#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
#define pq(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n, k, l;
  cin >> n >> k >> l;
  set<int> sta, stb;
  rep(i,0,k) {
    int a;
    cin >> a;
    sta.emplace(a-1);
  }
  rep(i,0,l) {
    int b;
    cin >> b;
    stb.emplace(b-1);
  }
  function<int(set<int>&, int)> f = [&](set<int> &st, int x) {
    auto itr = st.lower_bound(x);
    int ret = n;
    if (itr != st.end()) ret = *itr-x;
    if (itr != st.begin()) ret = min(ret, x-*prev(itr));
    return ret;
  };
  int d = n;
  for (int a : sta) {
    d = min(d, f(stb, a));
  }
  // cout << d << endl;
  int q;
  cin >> q;
  while(q--) {
    int s, t;
    cin >> s >> t;
    --s, --t;
    int sa = f(sta, s), sb = f(stb, s), ta = f(sta, t), tb = f(stb, t);
    // cout << sa << " " << sb << " " << ta << " " << tb << endl;
    int ans = min({abs(s-t), sa + ta, sb + tb, sa + d + tb, sb + d + ta});
    cout << ans << endl;
  }
  return 0;
}