UVA_11991_Easy_Problem

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define mp make_pair
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

int main() {
    int n, m, d, k;
    vector<vector<int> > v;
    while (scanf("%d %d", &n, &m) != EOF) {
        v.assign(1000000, vector<int>());

        for (int i = 1; i <= n; i++) {
            scanf("%d", &d);
            v[d].push_back(i);
        }

        for (int i = 0; i < m; i++) {
            scanf("%d %d", &k, &d);

            if (k - 1 < v[d].size())
                printf("%d\n", v[d][k - 1]);
            else
                printf("0\n");
        }
    }

    return 0;
}