#include <bits/stdc++.h>

using namespace std;

int dp[250001][20];

void Build_Dp(int n)
{
	for (int j = 1; j<=19; ++j)
		for (int i = 1; i<=n; ++i)
			dp[i][j] = dp[dp[i][j-1]][j-1];
}
int main(int argc, char const *argv[])
{
	ifstream fin ("stramosi.in");
	ofstream fout ("stramosi.out");
	int n, m;
	fin >> n >> m;
	for (int i = 1; i<=n; ++i)
		fin >> dp[i][0];
	Build_Dp(n);
	for (int i = 1; i<=m; ++i)
	{
		int x, count;
		fin >> x >> count;
		for (int i = 19; i>=0; --i)
			if (count >= (1<<i))
			{
				count -= (1<<i);
				x = dp[x][i];
			}
		fout << x << '\n';
	}
	return 0;
}