#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n, ka, kb;
    cin >> n >> ka >> kb;
    vector<int> a(ka), b(kb);
    cin >> a >> b;
    rep(i, ka) a[i]--;
    rep(i, kb) b[i]--;
    
    const int INF = 1e9;
    auto make = [&](vector<int> v) {
        vector<int> res(n, INF);
        for(int x: v) res[x] = 0;
        rep(i, n-1) chmin(res[i+1], res[i] + 1);
        repd(i, n-1, 0) chmin(res[i], res[i+1] + 1);
        return res;
    };
    vector<int> la = make(a);
    vector<int> lb = make(b);
    int tr = INF, pa = 0, pb = 0;
    while(pa < ka && pb < kb) {
        chmin(tr, abs(a[pa] - b[pb]));
        if(a[pa] < b[pb]) pa++;
        else pb++;
    }

    int q;
    cin >> q;
    while(q--) {
        int s, t;
        cin >> s >> t;
        s--, t--;
        int ans = INF;
        chmin(ans, abs(s - t));
        chmin(ans, la[s] + la[t]);
        chmin(ans, lb[s] + lb[t]);
        chmin(ans, la[s] + tr + lb[t]);
        chmin(ans, lb[s] + tr + la[t]);
        cout << ans << '\n';
    }
    return 0;
}