#include <cstdio>
#include <cmath>

#define FIN "stramosi.in"
#define FOUT "stramosi.out"
#define n_max 300000


long t[20][n_max], n, m, i, j, p, q, poz, max;

int main () {
	freopen(FIN, "r", stdin);
  freopen(FOUT, "w", stdout);
  scanf("%ld %ld", &n, &m);
  for (i=1; i<=n; i++) scanf("%ld", &t[0][i]);
  max = (long) (floor(log2((double)(n))));
  for (i=1; i<=max; i++)
     for (j=1; j<=n; j++)
        t[i][j] = t[i-1][t[i-1][j]];
  for (i=1; i<=m; i++) {
     scanf("%ld %ld", &q, &p);
     poz = max;
     while (p) {
       if (p & (1<<poz)) {
         q = t[poz][q];
         p -= (1<<poz);
       }
     	 poz--;
     }
  	 printf("%ld\n", q);
  }
  return 0;
}