#include<algorithm>
#include<assert.h>
using namespace std;
#define N_MAX 250002

int str[20][N_MAX];
int n,m,x,y;	
int i,adanc;

int main()
{
	freopen("stramosi.in","r",stdin);
	freopen("stramosi.out","w",stdout);
	
	scanf("%d%d",&n,&m);
	
	for(i=1;i<=n;i++)
		scanf("%d",&str[0][i]);
	
	adanc=1;
	for(int ok=1;ok;adanc++)
	{
		ok=0;
		for(i=1;i<=n;i++)
		{
			str[adanc][i]=str[adanc-1][str[adanc-1][i]];
			if(str[adanc][i])
				ok=1;
		}
	}
	
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		adanc=0;
		/*while(y&&x)
		{
			for(adanc=1;(adanc<<1)<=y&&adanc<18;adanc++);
			adanc--;
			
			x=str[adanc][x];
			y=y-(1<<adanc);
		}*/
		int nr;
		int q,p;
		 while (y)
		{
		  nr=1;
		  q=0;
		  while (2*nr<=q&&q<17)
			{nr*=2;q++;}
		  p=str[q][x];
		  x=p;
		  y-=nr;
		}

		
		printf("%d\n",x);
	}
	
	return 0;
}