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

#define MaxN 250100
#define MaxlgN 19

typedef struct _nod
{
	int info;
	struct _nod *adr;
} nod;

typedef struct
{
	struct _nod *cap;
} list;

list A[MaxN];
int V[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 add(int a,int b)
{
	nod *nou = (nod*)malloc(sizeof(nod));
	nou->info = b;
	nou->adr = A[a].cap;
	A[a].cap = nou;
}

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

void Complet(int a,int k)
{
	B[a][0] = k-1;
	for(int i=1,nr=1;nr<k;nr*=2,i++)
		B[a][i] = V[k-nr];
}

void DF(int a,int k)
{
	viz[a] = 1;
	V[k] = a;
	Complet(a,k);
	nod *q = A[a].cap;
	while(q)
	{
		if(!viz[q->info])
			DF(q->info,k+1);
		q = q->adr;
	}
}

int binary_search(int li,int ls,int a)
{
	if(li <= ls)
	{
	if(Doi[(li+ls)/2] == a)
		return (li+ls)/2;
	else if(Doi[(li+ls)/2] > a)
		return binary_search(li,(li+ls)/2-1,a);
	else
		return binary_search((li+ls)/2+1,ls,a);
	}
	return ls;
}

int LogDoiDinK(int &k)
{
	int nr = binary_search(0,18,k);
	k -= Doi[nr];
	return nr+1;
}

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

void CompletGraph(void)
{
	for(int i=1;i<=N;i++)
		if(!viz[i])
			DF(i,1);
}

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;
}