#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline long long nextnum(){
    long long a=0;
    char c=nextch();
    while((c<'0' || c>'9') && c!='-')
        c=nextch();
    int semn=1;
    if(c=='-'){
        semn=-1;
        c=nextch();
    }
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a*semn;
}

#define MAXN 250000
#define LOGN 18

int father[LOGN+1][MAXN+1];
int main(){
    fi=fopen("stramosi.in","r");
    fo=fopen("stramosi.out","w");
    int n=nextnum();
    int m=nextnum();
    for(int i=1;i<=n;i++)
        father[0][i]=nextnum();
    for(int i=1;i<=log2(n);i++)
        for(int j=1;j<=n;j++)
            father[i][j]=father[i-1][father[i-1][j]];
    for(int i=1;i<=m;i++){
        int q=nextnum(), p=nextnum();
        int ind=log2(p);
        while(p>0){
            if((1<<ind)<=p){
                q=father[ind][q];
                p=p-(1<<ind);
            }
            ind--;
        }
        /*while(p>0){
            int ind=log(p);
            q=father[ind][q];
            p=p-(1<<ind);
        }*/
        fprintf(fo,"%d\n", q);
    }
    fclose(fi);
    fclose(fo);
    return 0;
}