from collections import deque as D
I=input;Z=int;R=range
L=lambda :list(map(Z,I().split()))
M=Z(I())
C=D(L())
N,E=L()
#print(C,N,E)
B=D([-1]*(N+1))
O=[0]*N
e=D()
for _ in R(E):e.append(L())
T=-1
while len(e)>0:
 t,p=e[0]
 if T<t:
  T+=1
  B.appendleft(B.pop())
  if B[0]<0:
   B[0]=C[0]
   C.append(C.popleft())
 else:
  e.popleft()
  O[p-1]+=B[p]
  B[p]=-1
 #print(T,B,C,O)
 
print('\n'.join([str(x)for x in O]))