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

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 >> dp[i][0];
    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];
    for(int i = 1; i <= Q; ++i){
        fin >> x >> y;
        for(int i = log2(n); i >= 0; --i)
        if((1 << i) <= y)
           x = dp[x][i], y -= (1 << i);
        fout << x << '\n';
    }
}
int main()
{
    read_and_solve();
    return 0;
}