#include <bits/stdc++.h>

using namespace std;

const int MAXN = 250000;

int dp[20][MAXN + 1];

int main() {
  FILE *fin, *fout;
  fin = fopen ("stramosi.in", "r");
  fout = fopen ("stramosi.out", "w");
  int n, m, i, j, p, q;
  fscanf (fin, "%d%d", &n, &m);
  for (i = 1; i <= n; i++)
    fscanf (fin, "%d", &dp[0][i]);
  for (i = 1; (1 << i) <= n; i++)
    for (j = 1; j <= n; j++)
      dp[i][j] = dp[i - 1][dp[i - 1][j]];
  for (i = 1; i <= m; i++) {
    fscanf (fin, "%d%d", &p, &q);
    for (j = 0; (1 << j) <= n; j++)
      if ((q & (1 << j)) != 0)
        p = dp[j][p];
    fprintf (fout, "%d\n", p);
  }
  fclose (fin);
  fclose (fout);
}