#include <iostream>
#include <fstream>
#define nMax 250005
#define logMax 20
// dp[i][j] - al 2 ^ j stramosi a lui i
using namespace std;
int n, Q, T[nMax], dp[nMax][logMax], L[nMax];

void set_values()
{
   for(int j = 1; (1 << j) <= n; ++j)
      for(int i = 1; i <= n; ++i)
        if(dp[i][j - 1] != 0)
          dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
int query(int x, int y)
{
    if(L[x] < y) return 0;
    int step;
    for(step = 0; (1 << step) <= L[x]; ++step);
    --step;
    for(int i = step; i >= 0; --i)
        if((1 << i) <= y)
           x = dp[x][i], y -= (1 << i);
    return x;
}
void read_and_solve()
{
    ifstream fin("stramosi.in");
    ofstream fout("stramosi.out");
    fin >> n >> Q;
    int x, y;
    for(int i = 1; i <= n; ++i){
        fin >> x;
        L[i] = L[x] + 1;
        dp[i][0] = x;
    }
    set_values();
    for(int i = 1; i <= Q; ++i){
        fin >> x >> y;
        fout << query(x, y) << '\n';
    }
}
int main()
{
    read_and_solve();
    return 0;
}