////// metoda recursiva - varianta taranista //////////

#include <stdio.h>

#define IN "stramosi.in"
#define OUT "stramosi.out"
#define max 262144

FILE *fin=fopen(IN,"r");
FILE *fout=fopen(OUT,"w");

int n,m;
int t[max];
int sol;
inline void str(int c,int lvl);

int main()
{
 int i;
 int x,y;

 fscanf(fin,"%d %d",&n,&m);
 for(i=1;i<=n;i++)
  fscanf(fin,"%d",&t[i]);
 for(i=1;i<=m;i++)
 {
  fscanf(fin,"%d %d",&x,&y);
  sol=x;
  str(x,y);
  fprintf(fout,"%d\n",sol);
 }
 fclose(fin);
 fclose(fout);
 return 0;
}

inline void str(int c,int lvl)
{
 if(sol==0)
  return ;
 if(lvl==0)
  return;

 sol=t[c];
 str(sol,lvl-1);
}