#include <cstdio>

using namespace std;

struct cel
{
    int urm;
    cel *adr;
};

typedef cel *lda1;

lda1 lda[250005];
int n,m,x,stramos[250005][20],puteri[20],start[250005],q,p,lista[250005],trecut[250005],nr,apropiat[250005];


void parc(int nod)
{
    trecut[nod]=1;

    int i=0;
    while (nr-puteri[i]+1>0)
    {
        stramos[nod][i]=lista[nr-puteri[i]+1];
        ++i;
    }

    for (lda1 p=lda[nod];p!=0;p=p->adr)
    {
        if (trecut[p->urm]==0)
        {
            ++nr; lista[nr]=nod;
            parc(p->urm);
            --nr;
        }
    }
}

int main()
{
    freopen("stramosi.in","r",stdin);
    freopen("stramosi.out","w",stdout);

    scanf("%d %d",&n,&m);

    for (int i=1;i<=n;++i)
    {
        scanf("%d",&x);
        if (x!=0)
        {
            lda1 p=new cel;
            p->urm=i;
            p->adr=lda[x];
            lda[x]=p;
        }else ++start[0],start[start[0]]=i;
    }

    puteri[0]=1;
    for (int i=1;i<20;++i) puteri[i]=puteri[i-1]*2;
    apropiat[1]=0;
    for (int i=2;i<250005;++i)
    {
        apropiat[i]=apropiat[i-1];
        if (puteri[apropiat[i]+1]==i) ++apropiat[i];
    }

    for (int i=1;i<=start[0];i++)
    {
        parc(start[i]);
    }

    for (int i=1;i<=m;++i)
    {
        scanf("%d %d",&q,&p);
        if (p>250000) printf("0\n");
        else
        {
            while (p!=0)
            {
                q=stramos[q][apropiat[p]];
                p-=puteri[apropiat[p]];
            }
            printf("%d\n",q);
        }
    }

    fclose(stdin);
    fclose(stdout);
    return 0;
}