#include<fstream>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<array>
#include<deque>
#include<math.h>
#include<unordered_set>
#include<set>
#include<iomanip>
#include<bitset>
using namespace std;
int i, j, m, n,rmq[250250][19],lg,k,pw,q,p;
int find(int nr, int str)
{
	int logar = log2(str);
	int power = pow(2, logar);
	if (power == str)
		return rmq[nr][logar];
	else
		return find(rmq[nr][logar], str - power);
}
int main()
{
	//ifstream f("file.in");
	//ofstream g("file.out");	
	ifstream f("stramosi.in");
	ofstream g("stramosi.out");
	f >> n>> m;
	for (i = 1; i <= n; i++)
		f >> rmq[i][0];
	lg = log2(n);
	for (k = 1; k <= lg; k++)
	{
		for (i = 1; i <= n; i++)
		{
			rmq[i][k] = rmq[rmq[i][k - 1]][k - 1];
		}
	}
	for (k = 1; k <= m; k++)
	{
		f >> q >> p;
		g << find(q, p) << '\n';
	}
	return 0;
}