#include <fstream>
#include <vector>

const int MAX_N = 25 * 1e4;
const int MAX_LOG = 18;
std::vector<int> g[1 + MAX_N];
int up[1 + MAX_N][1 + MAX_LOG];
int par[1 + MAX_N];

void dfs(int v, int p = 0) {
  up[v][0] = p;
  for (int i = 1; i <= MAX_LOG; i++) {
    up[v][i] = up[up[v][i - 1]][i - 1];
  }
  for (int u : g[v]) {
    if (u != p) {
      dfs(u, v);
    }
  }
}

int main() {
  std::ifstream fin("stramosi.in");
  std::ofstream fout("stramosi.out");
  int n, k;
  fin >> n >> k;
  for (int i = 1; i <= n; i++) {
    fin >> par[i];
    if (par[i] > 0) {
      g[par[i]].push_back(i);
      g[i].push_back(par[i]);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (par[i] == 0) {
      dfs(i);
    }
  }
  while (k--) {
    int v, q;
    fin >> v >> q;
    int answer = v;
    for (int i = 0; i <= MAX_LOG; i++) {
      if ((q >> i) & 1) {
        answer = up[answer][i];
      }
    }
    fout << answer << "\n";
  }
  return 0;
}