import sys
input = sys.stdin.readline

from bisect import bisect

N,KA,KB=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))


def search_near(A,s):
    k=1<<30
    x=bisect(A,s)
    for i in range(x-1,x+2):
        if 0<=i<len(A):
            k=min(k,abs(s-A[i]))
    return k

AB=1<<30
for b in B:
    k=search_near(A,b)
    AB=min(AB,k)

Q=int(input())

for tests in range(Q):
    s,t=map(int,input().split())

    ANS=abs(s-t)

    # Aを使う

    k=search_near(A,s)
    l=search_near(A,t)

    ANS=min(ANS,k+l)

    # Bを使う

    m=search_near(B,s)
    n=search_near(B,t)

    ANS=min(ANS,m+n)

    ANS=min(ANS,k+AB+n)
    ANS=min(ANS,l+AB+m)

    print(ANS)