#include<stdio.h>
#include<malloc.h>

#define MaxN 250100
#define MaxlgN 19

int T[MaxN];
int viz[MaxN];
int B[MaxN][MaxlgN];
int Doi[21] = {1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144};
int N;
int M;
int a;
int b;

void citire(FILE *f)
{
	int a;
	fscanf(f,"%d %d",&N,&M);
	for(int i=1;i<=N;i++)
		fscanf(f,"%d ",&T[i]);
}

void CompletGraph(void)
{
	for(int i=1;i<=N;i++)
	{
		B[i][1] = T[i];
		for(int j=2;j<=18;j++)
			B[i][j] = B[B[i][j-1]][j-1];
	}
}

int LogDoiDinK(int &k)
{
	int nr;
	for(nr=0;Doi[nr]<=k;++nr);
	k -= Doi[--nr];
	return nr+1;
}

int FindStra(int a,int k)
{
	while(k)
	{
		int nr = LogDoiDinK(k);
		a = B[a][nr];
	}
	return a;
}


int main()
{
	FILE *f = fopen("stramosi.in","r");
	FILE *g = fopen("stramosi.out","w");

	citire(f);
	CompletGraph();
	for(int i=1;i<=M;i++)
	{
		fscanf(f,"%d %d",&a,&b);
		fprintf(g,"%d\n",FindStra(a,b));
	}

	fclose(g);
	fclose(f);
	return 0;
}