#include <iostream>
#include <fstream>
#define INF 300010
#define MIN 25
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, k;
int low[INF];
int ans[INF][MIN];
pair <int, int>query;
int main()
{
	f >> n >> k;
	for (int i = 1; i <= n; ++i)
	{
		f >> low[i];
	}
	for (int i = 1; i <= n; ++i)
	{
		ans[0][i] = low[i];
	}
	for (int i = 1; (1 << i) <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			ans[i][j] = ans[i - 1][ans[i - 1][j]];
		}
	}
	int rest = 0, bow = 0, temp = -1;
	for (int i = 1; i <= k; ++i)
	{
		f >> query.first >> query.second;
		bow = query.first;
		while (query.second)
		{
			temp++;
			rest = query.second % 2;
			if (rest == 1)
			{
				bow = ans[temp][bow];
			}
			query.second /= 2;
		}
		g << bow << "\n";
		temp = -1;
	}
	return 0;
}