#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, ka, kb; cin >> n >> ka >> kb;
	vector<int>a(ka);
	rep(i, ka)cin >> a[i], a[i]--;
	vector<int>b(kb);
	rep(i, kb)cin >> b[i], b[i]--;
	int ab = INF;
	rep(i, ka) {
		//以下の数
		int count = upper_bound(all(b), a[i]) - b.begin();
		if (count) {
			int x = b[count - 1];
			chmin(ab, abs(a[i] - x));
		}
		if (count != kb) {
			int x = b[count];
			chmin(ab, abs(a[i] - x));
		}
	}
	auto fa = [&](const int p)->int {
		int l = -INF, r = INF;
		int count = upper_bound(all(a), p) - a.begin();
		if (count) {
			l = a[count - 1];
		}
		if (count != ka) {
			r = a[count];
		}
		if (abs(p - l) < abs(p - r))return l;
		else return r;
	};

	auto fb = [&](const int p)->int {
		int l = -INF, r = INF;
		int count = upper_bound(all(b), p) - b.begin();
		if (count) {
			l = b[count - 1];
		}
		if (count != kb) {
			r = b[count];
		}
		if (abs(p - l) < abs(p - r))return l;
		else return r;
	};
	//cout << ab << endl;
	int q; cin >> q;
	while (q--) {
		int s, t; cin >> s >> t;
		s--, t--;
		int ans = abs(t - s);
		int as, bs, at, bt;
		as = fa(s);
		bs = fb(s);
		at = fa(t);
		bt = fb(t);
		//cout << as << " " << bs << " " << at << " " << bt << endl;
		chmin(ans, abs(as - s) + abs(at - t));
		chmin(ans, abs(bs - s) + abs(bt - t));
		chmin(ans, abs(as - s) + abs(bt - t) + ab);
		chmin(ans, abs(bs - s) + abs(at - t) + ab);
		cout << ans << endl;
	}
	return 0;
}