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 bisect import bisect

n, an, bn = LI()
aa = LI1()
bb = [-inf]+LI1()+[inf]

mn = inf
for a in aa:
    i = bisect(bb, a)
    mn = min(mn, a-bb[i-1], bb[i]-a)

aa = [-inf]+aa+[inf]

for _ in range(II()):
    s, t = LI1()
    i = bisect(aa, s)
    da = min(s-aa[i-1], aa[i]-s)
    i = bisect(bb, s)
    db = min(s-bb[i-1], bb[i]-s)
    i = bisect(aa, t)
    ea = min(t-aa[i-1], aa[i]-t)
    i = bisect(bb, t)
    eb = min(t-bb[i-1], bb[i]-t)
    ans = min(abs(s-t), da+ea, db+eb, da+eb+mn, db+ea+mn)
    print(ans)