#include<iostream>
#include<fstream>
#include<cmath>

using namespace std;

ifstream in("stramosi.in");
ofstream out("stramosi.out");

int d[18][250010];

int main()
{
	int i, n, q, nod, pas, j, last, logg;
	
	in >> n >> q;
	
	for(i = 1; i <= n; ++i)
		in >> 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;
		
		//p = pas;
		logg = log2((double)pas);
		
		//while(p >>= 1) logg++;
		
		for(i = logg; i >= 0 && nod; --i)
			if(pas & (1 << i))
				nod = d[i][nod];
			
		out << nod << "\n";
	}
	
	return 0;
}