#include <fstream>
#include <vector>

using namespace std;

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

int n, m, Log[250010], Level[250010], PD[20][250010];
vector < int > G[250010], V;

void DFS(int nod, int adancime)
{
    V.push_back(nod);
    Level[nod] = adancime;

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

    int aux = 0;
    while ((1 << aux) <= V.size() - 1)
    {
        PD[aux][nod] = V[V.size() - (1 << aux) - 1];
        aux ++;
    }
    V.pop_back();
}

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

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

    for (int i = 1, nod, nr, x; i <= m; i ++)
    {
        fin >> nod >> nr;
        if (Level[nod] < nr)
        {
            fout << "0\n";
            continue;
        }
        while (nr > 0)
        {
            x = Log[nr];
            nod = PD[x][nod];
            nr -= (1 << x);
        }
        fout << nod << '\n';
    }

    fout.close();
    return 0;
}