#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int N, K1, K2, Q, mi=1e9;
    cin >> N >> K1 >> K2;
    vector<int> a(K1+2), b(K2+2);
    a[0] = -1e8;
    a[K1+1] = 1e8;
    b[0] = -1e8;
    b[K2+1] = 1e8;
    for (int i=1; i<=K1; i++) cin >> a[i];
    for (int i=1; i<=K2; i++) cin >> b[i];
    for (int i=1; i<=K1; i++){
        auto it = lower_bound(b.begin(), b.end(), a[i]);
        mi = min(*it-a[i], mi);
        it--;
        mi = min(mi, a[i]-*it);
    }

    cin >> Q;
    while(Q--){
        int s, t, ans, sa, sb, ta, tb;
        cin >> s >> t;
        ans = t-s;
        auto it = lower_bound(a.begin(), a.end(), s);
        sa = min(*it-s, s-*prev(it));
        it = lower_bound(b.begin(), b.end(), s);
        sb = min(*it-s, s-*prev(it));
        it = lower_bound(a.begin(), a.end(), t);
        ta = min(*it-t, t-*prev(it));
        it = lower_bound(b.begin(), b.end(), t);
        tb = min(*it-t, t-*prev(it));
        ans = min(ans, sa+ta);
        ans = min(ans, sb+tb);
        ans = min(ans, sa+tb+mi);
        ans = min(ans, sb+ta+mi);
        cout << ans << '\n';
    }

    return 0;
}