#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int MAX=25e4+5;
const int LOG=20;
int n,m,up[LOG][MAX];
vector < int > children[MAX];

void DFS(int nod)
{
    for(int child : children[nod])
    {
        for(int i=1;(1<<i)<=n;i++)
            up[i][child]=up[i-1][up[i-1][child]];
        DFS(child);
    }
}

int main()
{
    fin >> n >> m;
    for(int nod=1;nod<=n;nod++)
    {
        fin >> up[0][nod];
        if(up[0][nod])
            children[up[0][nod]].push_back(nod);
    }
    for(int nod=1;nod<=n;nod++)
        if(!up[0][nod])
            DFS(nod);
    while(m--)
    {
        int k,nod;
        fin >> nod >> k;
        for(int i=0;(1<<i)<=k;i++)
            if(k&(1<<i))
                nod=up[i][nod];
        fout << nod << '\n';
    }
    return 0;
}