import sys
fir = input ().split ()
n = int (fir[0]) # 序列长度 int
m = int (fir[1]) # 操作的个数 每次选择不同的k int
q = int (fir[2]) # 询问的个数 int
K = input ().split () # 表示每次操作的k str k总数为m
P = input ().split () # 表示每次询问的p str p总数为q
K = list(map(int, K))
P = list(map(int, P))
flower = list (range (1, n + 1)) # 创建初始列表
for i in range (0, m): # 进行m次操作
if K[i] == 1:
continue
elif K[i]==n:
flower[0:n] = reversed (flower[0:n])
else:
if n & 1: # n是奇数
if K[i]& 1: # k是奇数
fl=reversed(flower[0:K[i]-1])
del flower[0:K[i]-1]
flower.extend(fl)
else: # k是偶数
fl=flower[0:K[i]-1]
del flower[0:K[i]-1]
flower.extend(fl)
else: # n是偶数
if K[i] & 1: # k是奇数'
fl=flower[0:K[i]-1]
del flower[0:K[i]-1]
flower.extend(fl)
else: # k是偶数
fl = reversed (flower[0:K[i]-1])
del flower[0:K[i]-1]
flower.extend (fl)
for i in range (0, q): # 输出每次询问的结果
if i < q - 1:
print (flower[P[i] - 1], end=" ")
else:
print (flower[P[i] - 1], end="")