#include <fstream>
#include <vector>

using namespace std;

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

int n, m, Sol[400010];
vector < int > V, G[350010];
vector < pair < int, int > > Q[350010];

void DFS(int nod)
{
    V.push_back(nod);

    for (vector < int > :: iterator it = G[nod].begin(); it != G[nod].end(); it ++)
    {
        DFS(*it);
    }

    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]);
    }
    V.pop_back();
}

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 } );
    }

    DFS(0);

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

    fout.close();
    return 0;
}