#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 100000000;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, ka, kb; cin >> n >> ka >> kb;
    vector<int> a(ka), b(kb);
    for (int i = 0; i < ka; i++) cin >> a[i];
    for (int i = 0; i < kb; i++) cin >> b[i];
    vector<int> wa(n + 1), wb(n + 1);
    int w1 = -INF, w2 = -INF, idx = 0;
    for (int i = 1; i <= n; i++) {
        if (w2 < i && idx < ka) {
            w1 = w2;
            w2 = a[idx++];
        }
        wa[i] = min(abs(w1 - i), abs(w2 - i));
    }
    w1 = -INF, w2 = -INF, idx = 0;
    for (int i = 1; i <= n; i++) {
        if (w2 < i && idx < kb) {
            w1 = w2;
            w2 = b[idx++];
        }
        wb[i] = min(abs(w1 - i), abs(w2 - i));
    }
    int idx1 = 0, idx2 = 0, diff = abs(a[0] - b[0]);
    while (idx1 < ka || idx2 < kb) {
        if (a[idx1] < b[idx2] && idx1 + 1 < ka) idx1++;
        else if (idx2 + 1 < kb) idx2++;
        else break;
        diff = min(diff, abs(a[idx1] - b[idx2]));
    }
    int q; cin >> q;
    for (int i = 0; i < q; i++) {
        int s, t; cin >> s >> t;
        int d0 = t - s, da = wa[s] + wa[t], db = wb[s] + wb[t];
        int dab = wa[s] + diff + wb[t], dba = wb[s] + diff + wa[t];
        int ans = min({d0, da, db, dab, dba});
        cout << ans << "\n";
    }
    return 0;
}