import sys
import bisect
input = sys.stdin.readline
N,Ka,Kb=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
Q=int(input())
inf=10**20
a2b=inf
for a in A:
    bi=bisect.bisect_left(B,a)
    if bi<len(B):
        a2b=min(a2b,B[bi]-a)
    if 0<=bi-1<len(B):
        a2b=min(a2b,a-B[bi-1])

def dist(A,a):
    bi=bisect.bisect_left(A,a)
    res=inf
    if bi<len(A):
        res = min(res,A[bi]-a)
    if 0<=bi-1<len(A):
        res = min(res,a-A[bi-1])
    return res

for _ in range(Q):
    s,t=map(int,input().split())
    s2a=dist(A,s)
    s2b=dist(B,s)
    t2a=dist(A,t)
    t2b=dist(B,t)
    print(min(abs(t-s),s2a+t2a,s2b+t2b,s2a+a2b+t2b,s2b+a2b+t2a))