#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, ka, kb;
  cin >> n >> ka >> kb;
  vector<char> has_a(n), has_b(n);
  VI da(n, n), db(n, n);
  rep(_, ka) {
    int a;
    cin >> a;
    a--;
    has_a[a] = 1;
    da[a] = 0;
  }
  rep(_, kb) {
    int b;
    cin >> b;
    b--;
    has_b[b] = 1;
    db[b] = 0;
  }
  rep(i, n - 1) chmin(da[i+1], da[i] + 1), chmin(db[i+1], db[i] + 1);
  rrep(i, n - 1) chmin(da[i], da[i+1] + 1), chmin(db[i], db[i+1] + 1);
  int dab = n;
  rep(i, n) if (has_b[i]) chmin(dab, da[i]);
  int q;
  cin >> q;
  while (q--) {
    int s, t;
    cin >> s >> t;
    s--, t--;
    int ans = min({abs(s - t), da[s] + da[t], db[s] + db[t], da[s] + dab + db[t], db[s] + dab + da[t]});
    cout << ans << '\n';
  }
}