from collections import deque

N, Ka, Kb = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
Sa, Sb = A[0] - 1, B[0] - 1
G = [[] for _ in range(N)]
for i in range(1, Ka):
  G[Sa].append((A[i] - 1, 0))
  G[A[i] - 1].append((Sa, 0))
for i in range(1, Kb):
  G[Sb].append((B[i] - 1, 0))
  G[B[i] - 1].append((Sb, 0))
for i in range(1, N):
  G[i - 1].append((i, 1))
  G[i].append((i - 1, 1))
dista = [-1 for _ in range(N)]
distb = [-1 for _ in range(N)]
dista[Sa] = 0
distb[Sb] = 0

dq = deque([Sa])
while dq:
  u = dq.popleft()
  for v, d in G[u]:
    if dista[v] == -1:
      dista[v] = dista[u] + d
      if d == 0:
        dq.appendleft(v)
      else:
        dq.append(v)
    if dista[v] > dista[u] + d:
      dista[v] = dista[u] + d
      if d == 0:
        dq.appendleft(v)
      else:
        dq.append(v)

dq = deque([Sb])
while dq:
  u = dq.popleft()
  for v, d in G[u]:
    if distb[v] == -1:
      distb[v] = distb[u] + d
      if d == 0:
        dq.appendleft(v)
      else:
        dq.append(v)
    if distb[v] > distb[u] + d:
      distb[v] = distb[u] + d
      if d == 0:
        dq.appendleft(v)
      else:
        dq.append(v)

Q = int(input())
for _ in range(Q):
  s, t = map(int, input().split())
  s -= 1
  t -= 1
  ans = min(abs(s - t), dista[s] + dista[t], distb[s] + distb[t])
  print(ans)