n,a=map(int,input().split())
x=list(map(int,input().split()))
x.sort()
q=[]
for i in range(n):
  q+=[(x[i],1,i)]
t=int(input())
for i in range(t):
  l,r=map(int,input().split())
  q+=[(l,0,i)]
  q+=[(r,2,i)]
q.sort()
ans=[-1]*n
v=[0]*t
from heapq import heappush,heappop
p=[]
for x,y,z in q:
  if y==0:
    heappush(p,-z)
    v[z]=1
  if y==1:
    u=-1
    while len(p)>0:
      u=-heappop(p)
      if v[u]:
        break
      else:
        u=-1
    if u>=0:
      ans[z]=u+1
      heappush(p,-u)
  if y==2:
    v[z]=0
print(*ans,sep="\n")