#include<fstream>
#include<algorithm>
using namespace std;
int n,m,i,j,x,y,tata[250001];
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",&tata[i]);
		if(tata[i]==i-1)
			++j;
	}
	if(j==n)
		for(i=1;i<=m;++i)
		{
			scanf("%d%d",&x,&y);
			printf("%d\n",max(x-y,0));
		}
		else
	
	for(i=1;i<=m;++i)
	{
		scanf("%d%d",&x,&y);
		while(y&&x)
		{
			--y;
			x=tata[x];
		}
		printf("%d\n",x);
	}
	return 0;
}