import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import deque

def dist(aa):
    q = deque(aa)
    dd = [-1]*n
    for a in aa: dd[a] = 0
    while q:
        i = q.popleft()
        d = dd[i]
        if i and dd[i-1] == -1:
            dd[i-1] = d+1
            q.append(i-1)
        if i+1 < n and dd[i+1] == -1:
            dd[i+1] = d+1
            q.append(i+1)
    return dd

n, an, bn = LI()
aa = LI1()
bb = LI1()

da = dist(aa)
db = dist(bb)

mn = inf
i = 0
for a in aa:
    while i < bn and bb[i] < a: i += 1
    if i: mn = min(mn, a-bb[i-1])
    if i < bn: mn = min(mn, bb[i]-a)

for _ in range(II()):
    s, t = LI1()
    ans = min(abs(s-t), da[s]+da[t], db[s]+db[t], da[s]+db[t]+mn, db[s]+da[t]+mn)
    print(ans)