#include <fstream>
using namespace std;

ifstream fin("stramosi.in");
ofstream fout("stramosi.out");

const int NMax = 250000;
int N,M;
int Ancestor[21][NMax + 5];
int Log2[NMax + 5];

void Read()
{
    fin >> N >> M;

    for(int i = 1; i <= N; ++i)
      fin >> Ancestor[0][i];
}

void PreCalculate()
{
  for(int i = 2; i <= N; ++i)
  {
    Log2[i] = Log2[i/2] + 1;
  }
  for(int i = 1; (1<<i) <= N ; ++i)
    for(int j = 1; j <= N; ++j)
      Ancestor[i][j] = Ancestor[i-1][Ancestor[i-1][j]];
}

int FindAncestor(int Q, int P)
{
  int K;
  while(P)
  {
    K = Log2[P];
    Q = Ancestor[K][Q];
    P = P - (1<<K);
  }

  return Q;
}

void SolveandPrint()
{
  while(M--)
    {
      int Q,P;
      fin >> Q >> P;
      fout << FindAncestor(Q,P) << "\n";
    }
}

int main()
{
    Read();
    PreCalculate();
    SolveandPrint();
    return 0;
}