#include <iostream>
#include <fstream>

const int MAXN = 250000,MAXLOG = 17;

using namespace std;

ifstream in("stramosi.in");
ofstream out("stramosi.out");

int dp[MAXN + 5][MAXLOG + 5],log[MAXN + 5];
int n,q,i,put;

inline int query(int nod,int stramos){
    while(stramos > 0 && nod > 0){
        nod = dp[nod][log[stramos]];
        stramos -= (1 << log[stramos]);
    }
    return nod;
}
int main()
{
    in>>n>>q;
    for(i = 1; i <= n; ++i)
        in>>dp[i][0];
    for(i = 2; i <= n; ++i)
        log[i] = log[(i >> 1)] + 1;
    for(put = 1; put <= MAXLOG; ++put)
        for(i = 1; i <= n; ++i)
            dp[i][put] = dp[dp[i][put - 1]][put - 1];
    for(i = 1; i <= q; ++i){
        int nod,k_stramos;
        in>>nod>>k_stramos;
        out<<query(nod,k_stramos)<<'\n';
    }

    return 0;
}