#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream fin ("stramosi.in");
ofstream fout ("stramosi.out");

int n, m, Sol[300010];
vector < int > V, G[250010];
vector < pair < int, int > > Q[250010];
stack < int > S;
bool F[250010];

int main()
{
    fin >> n >> m;
    for (int i = 1, x; i <= n; i ++)
    {
        fin >> x;
        G[x].push_back(i);
    }

    for (int i = 1, nod, nr; i <= m; i ++)
    {
        fin >> nod >> nr;
        Q[nod].push_back( { nr, i } );
    }

    S.push(0);
    while (!S.empty())
    {
        int nod = S.top();
        if (!F[nod]) V.push_back(nod);

        if (!F[nod])
        {
            for (vector < pair < int, int > > :: iterator it = Q[nod].begin(); it != Q[nod].end(); it ++)
            {
                Sol[it -> second] = (int(V.size()) - 1 - it -> first < 0 ? 0 : V[int(V.size()) - 1 - it -> first]);
            }
        }
        F[nod] = true;

        if (!G[nod].empty())
        {
            S.push(G[nod].back());
            G[nod].pop_back();
        }
        else
        {
            S.pop();
            V.pop_back();
        }
    }

    for (int i = 1; i <= m; i ++)
    {
        fout << Sol[i] << '\n';
    }

    fout.close();
    return 0;
}