#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}


void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, Ka, Kb;
    cin >> N >> Ka >> Kb;
    auto f = [&](vector<int> v) -> vector<int> {
        vector<int> res(N + 1, INF);
        for (auto x : v) res[x] = 0;
        rep(i, 0, N) chmin(res[i + 1], res[i] + 1);
        for (int i = N; i > 0; i--) chmin(res[i - 1], res[i] + 1);
        return res;
    };
    int AB = INF;
    vector<int> A(Ka), B(Kb);
    rep(i, 0, Ka) cin >> A[i];
    rep(i, 0, Kb) cin >> B[i];
    auto X = f(A);
    auto Y = f(B);
    rep(i, 0, N + 1) if (X[i] == 0) chmin(AB, Y[i]);
    int Q;
    cin >> Q;
    while (Q--){
        int s, t;
        cin >> s >> t;
        if (s > t) swap(s, t);
        int ans = t - s;
        chmin(ans, X[t] + X[s]);
        chmin(ans, Y[t] + Y[s]);
        chmin(ans, X[t] + Y[s] + AB);
        chmin(ans, Y[t] + X[s] + AB);
        cout << ans << "\n";
    }
}