#include <iostream>
#include <fstream>

const int MAXN = 250000 + 5,MAXLOG = 17;

using namespace std;

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

int dp[MAXN][MAXLOG],bit[MAXN];
int n,q;

inline int query(int nod,int stramos){
    int ans = 0;
    for(int j = 0; j < MAXLOG; ++j){
        if(stramos & (1<<j)){
            if(!dp[nod][j])
                return 0;
            ans = dp[nod][j];
            nod = dp[nod][j];
        }
    }
    return ans;
}
int main()
{
    in.tie(NULL);
    out.tie(NULL);
    ios::sync_with_stdio(false);

    in>>n>>q;
    for(int i = 1; i <= n; ++i){
        int tata;
        in>>tata;
        dp[i][0] = tata;
    }

    for(int put = 1; put <= MAXLOG; ++put)
        for(int i = 1; i <= n; ++i)
            if(i + (1 << (put - 1)) < MAXN)
                dp[i][put] = dp[dp[i][put - 1]][put - 1];

    for(int i = 1; i <= q; ++i){
        int nod,k_stramos;
        in>>nod>>k_stramos;
        out<<query(nod,k_stramos)<<'\n';
    }

    return 0;
}