#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
    int N, KA, KB;
    cin >> N >> KA >> KB;
    vector<int> A(KA), B(KB);
    for(int i = 0; i < KA; i++) cin >> A[i], A[i]--;
    for(int i = 0; i < KB; i++) cin >> B[i], B[i]--;
    auto Calc = [&N](const vector<int>& C) -> vector<int> {
        vector<int> res(N, 1e9);
        for(int x: C) res[x] = 0;
        int tmp = 1e9;
        for(int i = N - 1; i >= 0; i--) {
            res[i] = min(res[i], tmp - i);
            if(res[i] == 0) tmp = i;
        }
        tmp = -1e9;
        for(int i = 0; i < N; i++) {
            res[i] = min(res[i], i - tmp);
            if(res[i] == 0) tmp = i;
        }
        return res;
    };
    auto NA = Calc(A);
    auto NB = Calc(B);
    int cst = 1e9;
    for(int i = 0; i < N; i++) {
        cst = min(cst, NA[i] + NB[i]);
    }
    int Q;
    cin >> Q;
    while(Q--) {
        int s, t;
        cin >> s >> t;
        s--, t--;
        int ans = t - s;
        ans = min(ans, NA[s] + NA[t]);
        ans = min(ans, NB[s] + NB[t]);
        ans = min(ans, NA[s] + cst + NB[t]);
        ans = min(ans, NB[s] + cst + NA[t]);
        cout << ans << endl;
    }
}