//https://www.infoarena.ro/problema/stramosi

#pragma GCC optimize("O3")   
#pragma GCC optimize("Ofast") 
#pragma GCC optimize("fast-math") 
#pragma GCC optimize("unroll-loops") 
#pragma GCC optimize("inline")  
//#define _USE_MATH_DEFINES
//#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <fstream>
//#include <vector>
//#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <stack>
//#include <utility>
//#include <algorithm>
//#include <string>
//#include <map>
//#include <unordered_map>
//#include <set>
//#include <unordered_set>
//#include <cstdint>
//#include <climits>
//#include <iomanip>
//#include <cstdio>
//#include <tuple>

using namespace std;

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

const int NRMAX = 250000;

int dp[20][NRMAX + 1];
int main()
{
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	int n, m, i, j;

	fin >> n >> m;
	for (int i = 1; i <= n; ++i)
		fin >> dp[0][i];

	for (i = 1; (1 << i) <= n; ++i)
		for (j = 1; j <= n; ++j)
			dp[i][j] = dp[i - 1][dp[i - 1][j]];

	for (i = 1; i <= m; ++i)
	{
		int  q, p;
		fin >> q >> p;

		for (j = 0; p; ++j)
		{
			if (p & 1)
				q = dp[j][q];
			p = p >> 1;
		}
		fout << q << "\n";
	}

	return 0;
}