#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

int p[20][250005];

int n,m,q,x;

void solve(){
    int t=x, cnt=0;
    while(q){
        if(q%2==0){
            q/=2;
            ++cnt;
        }
        else{
            --q;
            t=p[cnt][t];
            //cnt=0;
        }
    }
    printf("%d\n", t);
}

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", &p[0][i]);

    for(int i=1;i<=n;++i)
        for(int j=1;j<20;++j)
            p[j][i]=p[p[j][i-1]][i-1];

    for(int i=0;i<m;++i){
        scanf("%d%d", &x,&q);
        solve();
    }

    return 0;
}