STL uva 11991

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<string>
#include<vector>
#include<map>
using namespace std;
int n,m;
map<int,vector<int> > mp;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
mp[x].push_back(i);
}
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
if(mp[y].size()<x)
printf("0\n");
else
printf("%d\n",mp[y][x-1]);
}
}
return 0;
}