#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define CHECK(x) if(!(x)) return false;
#define CHECKRET(x, y) if(!(x)) return (y);
#define SKIP(x) if((x)) continue;

#ifdef INFOARENA
#define ProblemName "stramosi"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

const int MAXN = 250010;
const int MAXLOG = 20;

int p[MAXLOG][MAXN];
int N;

int main() {
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  int Q;
  scanf("%d%d", &N, &Q);
  for (int i = 0; i < N; ++i) {
    scanf("%d", &p[0][i]);
    --p[0][i];
  }
  for (int l = 1; l < MAXLOG; ++l)
    for (int i = 0; i < N; ++i) {
      SKIP(p[l - 1][i] < 0);
      p[l][i] = p[l - 1][p[l - 1][i]];
    }
  while (Q--) {
    int x, nr;
    scanf("%d%d", &x, &nr);
    --x;
    for (int i = MAXLOG - 1; i >= 0 && x >= 0; --i) {
      int pw = (1 << i);
      SKIP(pw > nr);
      nr -= pw;
      x = p[i][x];
    }
    printf("%d\n", x + 1);
  }
  return 0;
}