#include<fstream>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<climits>
#include<iomanip>
#include<cstring>
#include<bitset>

#define MAX 250000

using namespace std;

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

//ifstream f("in.in");
//ofstream g("out.out");

int dp[MAX+5][20],n,m,q,p,k;


int main(){

    f>>n>>m;
    for( int i=1;i<=n;i++){
        f>>dp[i][0];
        k=1;
        while(dp[dp[i][k-1]][k-1] != 0){
            dp[i][k] = dp[dp[i][k-1]][k-1];
            k++;
        }
    }
    for(int i=1;i<=m;i++){
        f>>q>>p;

        for(int k = 18;k>=0,p!=0;k--){
            if((1<<k)<=p){
                p-=(1<<k);
                q = dp[q][k];
            }
        }
        g<<q<<'\n';
    }

    f.close();
    g.close();
    return 0;
}