#include <fstream>
#include <vector>

using namespace std;

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

int a[300005], b[250005], n, m, p, x, indice[250005], q[250005], ans[300005], grad[300005];
vector <int> v[300005], indiceq[300005];
bool visited[300005];

void solve(int nod)
{
    for(int i=0; i<indiceq[nod].size(); i++)
        if(indice[nod]>=grad[indiceq[nod][i]]) //sa aiba stramosi de rang cerut
            ans[indiceq[nod][i]]=q[indice[nod]-grad[indiceq[nod][i]]];
            else ans[indiceq[nod][i]]=0;
}

void dfs(int nod)
{
    visited[nod]==1;
    q[indice[nod]]=nod; //memoram in q stramosii fiecarui nod
    solve(nod);
    for(int i=0; i<v[nod].size(); i++)
    {
        indice[v[nod][i]]=indice[nod]+1; // lungimea q
        dfs(v[nod][i]);
    }
}

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

    for(int i=1; i<=m; i++)
        {
            fin >> p >> grad[i];
            indiceq[p].push_back(i);
        }

    dfs(1);
     for(int i=1; i<=n; i++)
        if(!visited[i])
     {
         dfs(i);
     }
    for(int i=1; i<=m; i++)
    fout << ans[i] << "\n";

    fin.close();
    fout.close();
    return 0;
}