#include <fstream>
#include <iostream>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#define LL long long
#define DN 250005
using namespace std;

int anc[DN][30], power2[30];

int biggest_power(int x, int &i){
  int left = 0, right = 20, mid;
  while(left < right - 1){
    mid = (left + right) / 2;
    if(power2[mid] == x){
      i = power2[mid];
      return mid;
    }
    if(power2[mid] < x){
      left = mid;
    }
    else
      right = mid;
  }
  i = power2[left];
  return left;
}

int find_anc(int x, int p){
  if(p == 0)
    return x;
  int res;
  int power = biggest_power(p, res);
  return find_anc(anc[x][power], p - res);
}

int main() {
  int n, m, x, p;
  ifstream fin("stramosi.in");
  ofstream fout("stramosi.out");

  for(int i = 0, j = 1; i <= 20; ++i, j *= 2)
    power2[i] = j;

  fin >> n >> m;
  for(int i = 1; i <= n; ++i){
    fin >> anc[i][0];
  }
  for(int j = 1; j < 20; ++j)
    for(int i = 1; i <= n; ++i){
      anc[i][j] = anc[anc[i][j-1]][j-1];
    }

  for(int i = 0; i < m; ++i){
    fin >> x >> p;
    fout << find_anc(x, p) << '\n';
  }
  return 0;
}