#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int N, KA, KB;
	cin >> N >> KA >> KB;
	vector<int> A(KA + 2), B(KB + 2);
	rep(i, 1, KA + 1) cin >> A[i];
	rep(i, 1, KB + 1) cin >> B[i];
	A[0] = -(1 << 28);
	B[0] = -(1 << 28);
	A[KA + 1] = 1 << 28;
	B[KB + 1] = 1 << 28;
	
	vector<int> dA(N + 1), dB(N + 1);
	rep(i, 1, N + 1) {
		int idx = lower_bound(A.begin(), A.end(), i) - A.begin();
		dA[i] = min(abs(A[idx] - i), abs(A[idx - 1] - i));
		idx = lower_bound(B.begin(), B.end(), i) - B.begin();
		dB[i] = min(abs(B[idx] - i), abs(B[idx - 1] - i));
	}
	
	int dAB = N*2;
	rep(i, 1, KB + 1) {
		int idx = lower_bound(A.begin(), A.end(), B[i]) - A.begin();
		dAB = min(dAB, min(abs(A[idx] - B[i]), abs(A[idx - 1] - B[i])));
	}
	
	int Q;
	cin >> Q;
	rep(query, 0, Q) {
		int s, t;
		cin >> s >> t;
		
		int ans = t - s;
		ans = min(ans, dA[s] + dA[t]);
		ans = min(ans, dB[s] + dB[t]);
		ans = min(ans, dA[s] + dB[t] + dAB);
		ans = min(ans, dB[s] + dA[t] + dAB);
		
		cout << ans << '\n';
	}
}