#include <bits/stdc++.h>
using namespace std;
int main()
{
  long long n,A,t,a,b;
  cin >> n >> A;
  vector<long long>iti(n);
  vector<pair<long long,long long>>iti2(n);
  for(int i=0;i<n;i++)cin >> iti[i];
  for(int i=0;i<n;i++)iti2[i].first=iti[i],iti2[i].second=i;
  sort(iti2.begin(),iti2.end());
  vector<long long>ans(n,-1);
  vector<pair<long long,long long>>start;
  vector<pair<long long,long long>>goal;
  cin >> t;
  for(int q=0;q<t;q++){
    cin >> a >> b;
    start.push_back(make_pair(a,q+1));
    goal.push_back(make_pair(b+1,q+1));
  }
  int x=0,y=0;
  sort(start.begin(),start.end());
  sort(goal.begin(),goal.end());
  set<long long>st;
  priority_queue<long long>prq;
  for(int i=0;i<n;i++){
    while(x<t && start[x].first<=iti2[i].first){
      prq.push(start[x].second);
      x++;
    }
    while(y<t && goal[y].first<=iti2[i].first){
      st.insert(goal[y].second);
      y++;
    }
    while(prq.size()>0 && st.count(prq.top())>0)prq.pop();
    if(prq.size()>0)ans[iti2[i].second]=prq.top();
  }
  for(int i=0;i<n;i++)cout << ans[i] << endl;
  return 0;
}