#include <iostream>
#include <fstream>

using namespace std;
ifstream in ("stramosi.in");
ofstream out ("stramosi.out");
int const nmax = 250000;
int const lgmax = 18;
int lg[5 + nmax];
int far[5 + nmax][5 + lgmax];
int n;

inline void computefar(){
  for(int h = 1 ; h <= lgmax ;h++){
    for(int i = 1 ; i <= n ;i++){
      far[i][h] = far[far[i][h - 1]][h - 1];
    }
  }
}
inline int query(int node ,int p){
  while(0 < p && 0 < node){
    node = far[node][lg[p]];
    p -= (1 << lg[p]);
  }
  return node;
}
int main()
{
  int k;
  in >> n >> k;
  for(int i = 1 ; i <= n ;i++){
    in >> far[i][0];
  }
  lg[1] = 0;
  for(int i = 2 ; i <= n ;i++){
    lg[i] = lg[(i >> 1)] + 1;
  }
  computefar();
  for(int i = 1 ; i <= k ;i++){
    int a , b;
    in >> a >> b;
    out << query(a , b) << '\n';
  }
  return 0;
}