#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

int n,m,par[250010][19],Q,P;

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",&par[i][0]);
    }
    for (int i=1;(1<<i)<=n;i++){
        for (int j=1;j<=n;j++){
            par[j][i]=par[par[j][i-1]][i-1];
        }
    }
    while (m--){
        scanf("%d%d",&Q,&P);
        int j=0;
        while (P){
            if (P&1){
                Q=par[Q][j];
            }
            j++;
            P>>=1;
        }
        printf("%d\n",Q);
    }
    //system("pause");
    return 0;
}