#include<stdio.h>
//#include<fstream>

//using namespace std;

int d[18][250010];

int main()
{
	//ifstream in("stramosi.in");
	freopen("stramosi.in", "r", stdin);
	freopen("stramosi.out", "w", stdout);
	//ofstream out("stramosi.out");
	
	int i, n, q, nod, pas, j, last;
	
	//in >> n >> q;
	scanf("%d %d", &n, &q);
	
	for(i = 1; i <= n; ++i)
		//in >> d[0][i];
		scanf("%d ", &d[0][i]);
	
	for(i = 1; (1 << i) <= n; ++i)
		for(j = 1; j <= n; ++j){
			last = d[i - 1][j];
			d[i][j] = d[i - 1][last];
		}
		
	while(q--){
		//in >> nod >> pas;
		scanf("%d %d", &nod, &pas);
		
		for(i = 0; (1 << i) <= pas && nod; ++i)
			if(pas & (1 << i))
				nod = d[i][nod];
			
		//out << nod << "\n";
		printf("%d\n", nod);
	}
	
	return 0;
}