wormholes

#include<iostream>
#include<algorithm>

using namespace std;

    long long n, x, y;
    long long counter, mincounter = 10000010, s , e;

int main(){
    cin >> n >> x >> y;
    pair <long long , long long > a[n];
    long long v[x];
    long long w[y];
    for(long long i = 0; i < n; i++){
        cin >> a[i].first >> a[i].second;
    }
    for(long long i = 0; i < x; i++){
        cin >> v[i];
    }
    for(long long i = 0; i < y; i++){
        cin >> w[i];
    }
    sort(a, a+n);
    sort(v, v+x);
    sort(w, w+y);
    for(long long i = 0; i < n; i++){
        s = -1000010;
        for(long long j = 0; j < x; j++){
            if(v[j] <= a[i].first){
                s = max(s, v[j]);
            } else {
                break;
            }
        }
        e = 1000010;
        for(long long k = y-1; k >= 0; k--){
            if(w[k] >= a[i].second){
                e = min(e, w[k]);
            } else {
                break;
            }
        }
        counter = e - s + 1;
        mincounter = min(mincounter, counter);
    }
    cout << mincounter << endl;
    return 0;
}