uva11991

#include <map>
#include <vector>
#include <math.h>
#include <string>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;
#define ll long long
#define ull unsigned long long
#define cls(x) memset(x,0,sizeof(x))
#define clslow(x) memset(x,-1,sizeof(x))

const int mod=1e9+7;
const int maxn=1e5+100;

int n,m,tot;

int a[maxn];
map<int,int>pos;

struct Node{
    int val;
    vector<int>v;
};
Node node[maxn];

int main()
{
//    freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        tot=1;
        pos.clear();
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            if(!pos[a[i]]){
                node[tot].v.clear();
                pos[a[i]]=tot;
                node[tot].val=a[i];
                node[tot++].v.push_back(i);
            }
            else{
                node[pos[a[i]]].v.push_back(i);
            }
        }

        for(int i=1;i<=m;i++){
            int k,v,ans;
            scanf("%d%d",&k,&v);
            if(node[pos[v]].v.size()<k||pos[v]==0)   ans=0;
            else    ans=node[pos[v]].v[k-1];
            printf("%d\n",ans);
        }
    }
    return 0;
}