#include <fstream>
using namespace std;
int d[2505][2505];
int m, n, q, p;
int query(int q, int p)
{
   while(p > 0) {
      int p2 = 1, i;
      for(i = 0; p2*2 <= p; ++i) p2 = p2*2;
      int j = 0;
      while(j < i) {
         d[q][j + 1] = d[d[q][j]][j];
         ++j;
      }
      q = d[q][i];
      p = p - p2;
   }
   return q;
}
int main()
{
    ifstream in("stramosi.in");
    ofstream out("stramosi.out");
    in >> n >> m;
    for(int i = 1; i <= n; ++i) {
      in >>  d[i][0];
    }
    for(int i = 1; i <= m; ++i) {
      in >> q >> p;
      out << query(q, p) << '\n';
    }
    return 0;
}