# include <fstream>
# include <algorithm>
# include <vector>
# define N 250005
# define M 300005
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
vector <int> v[N];
struct elem
{
    int ord, q;
}E;
vector <elem> querry[M];
int i,j,n,m,x,y,VV;
int st[N], sol[M];
bool in[N], ap[N];
void DFS (int k)
{
    int i;
    vector <elem>::iterator jt;
    ap[k]=1; st[++VV]=k;
    for (jt=querry[k].begin(); jt<querry[k].end(); ++jt)
    {
        if ((*jt).q>=VV) sol[(*jt).ord]=0;
        else sol[(*jt).ord]=st[VV-(*jt).q];
    }
    for (i=0; i<v[k].size(); ++i)
        if (! ap[v[k][i]]) DFS(v[k][i]);
    --VV;
}
int main ()
{
    f>>n>>m;
    for (i=1; i<=n; ++i)
    {
        f>>x; v[x].push_back(i);
        if (x!=0) in[i]=1;
    }
    for (i=1; i<=m; ++i)
    {
        f>>x>>y;
        E.ord=i; E.q=y;
        querry[x].push_back(E);
    }

    for (i=1; i<=n; ++i)
        if (! in[i]) DFS(i);

    for (i=1; i<=m; ++i)
        g<<sol[i]<<"\n";

    return 0;
}