#include <cstdio>

const int N=1<<5;
const int M=1<<18;
int p[N][M];

int cnt(int x,int y){
    int i=0;
    while (y){
        if (y&1) x=p[i][x];
        i++;
        y>>=1;
    }
    return x;
}

int main(){
    int n,m;
    freopen("stramosi.in","r",stdin);
    freopen("stramosi.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++) scanf("%d",&p[0][i]);
    for (int i=1;(1<<i)<=n;i++)
        for (int j=1;j<=n;j++)
            p[i][j]=p[i-1][p[i-1][j]];
    while (m--){
        int Q,P;
        scanf("%d%d",&Q,&P);
        printf("%d\n",cnt(Q,P));
    }
    return 0;
}