N, K1, K2 = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
Q = int(input())
query = [list(map(int, input().split())) for _ in range(Q)]

MIN = 10**18
idx = 0
for a in A:
    while idx < K2 and B[idx] < a:
        idx += 1
    if idx == 0:
        MIN = min(MIN, B[idx]-a)
    elif idx == K2:
        MIN = min(MIN, a-B[idx-1])
    else:
        MIN = min(MIN, B[idx]-a, a-B[idx-1])

idx1, idx2 = 0, 0
F1 = []
F2 = []
for i in range(N):
    if idx1 == 0:
        F1.append(A[idx1]-(i+1))
    elif idx1 == K1:
        F1.append((i+1)-A[-1])
    else:
        F1.append(min(A[idx1]-(i+1), (i+1)-A[idx1-1]))
    if idx2 == 0:
        F2.append(B[idx2]-(i+1))
    elif idx2 == K2:
        F2.append((i+1)-B[-1])
    else:
        F2.append(min(B[idx2]-(i+1), (i+1)-B[idx2-1]))
    if idx1 < K1 and A[idx1] == i+1:
        idx1 += 1
    if idx2 < K2 and B[idx2] == i+1:
        idx2 += 1

for s, t in query:
    s, t = s-1, t-1
    print(min(t-s, F1[s]+F1[t], F2[s]+F2[t], F1[s]+MIN+F2[t], F2[s]+MIN+F1[t]))