//#include<cstdio>
#include<fstream>
#define MAX 250000
using namespace std;

int dist[MAX+1];
int t[MAX+1][19];
int n;


int pas;


void build(){
    int i,j,fl=1;

    for(i=1;(1<<i)<=n &&fl==1;i++){
        fl=0;
        for(j=1;j<=n;j++){
            t[j][i]=t[t[j][i-1]][i-1];
            if (t[j][i]!=0) fl=1;
        }
    }
}


int query(int ad,int x){
    while(ad>0){
        while((1<<pas)>ad) pas--;
        ad-=(1<<pas);

        x=t[x][pas];

        if (x==0) ad=0;
    }

    return x;
}


int main(){
    //freopen ("stramosi.in","r",stdin);
    //freopen ("stramosi.out","w",stdout);
    ifstream fin("stramosi.in");
    ofstream fout("stramosi.out");
    int i,j,m,p,q,fl=1;

    //scanf ("%d%d",&n,&m);
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>t[i][0];
        //scanf ("%d",&t[i][0]);

    //build();
    for(i=1;(1<<i)<=n &&fl==1;i++){
        fl=0;
        for(j=1;j<=n;j++){
            t[j][i]=t[t[j][i-1]][i-1];
            if (t[j][i]!=0) fl=1;
        }
    }


    for(i=1;i<=m;i++){
        fin>>q>>p;
        //scanf ("%d%d",&q,&p);
        //pas=18;
        //printf ("%d\n",query(p,q));

        pas=0;
        while((1<<(pas+1))<=p) pas++;

        while(p>0){
            while((1<<pas)>p) pas--;
            p-=(1<<pas);

            q=t[q][pas];

            if (q==0) p=0;
        }

        //printf ("%d\n",q);
        fout<<q<<'\n';
    }

    return 0;
}