#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int Nmax=250005;
const int Mmax=300005;
vector<int> L[Nmax];
vector<pair<int,int>> queries[Nmax];
vector<int> currPath;
int sol[Mmax];
void dfs(int node)
{
currPath.push_back(node);
for(auto qry:queries[node])
{
int idx=currPath.size()-1-qry.first;
if(idx>=0)
{
sol[qry.second]=currPath[idx];
}
}
for(int son:L[node])
{
dfs(son);
}
currPath.pop_back();
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
int tata;
fin>>tata;
L[tata].push_back(i);
}
for(int i=1;i<=m;i++)
{
int x,k;
fin>>x>>k;
queries[x].push_back({k,i});
}
dfs(0);
for(int i=1;i<=m;i++)
{
fout<<sol[i]<<'\n';
}
return 0;
}