#include <stdio.h>
#include <math.h>

#define X 19

long i, j, n, m, s, t, Q, P, v[X][250000];

int main() {
	freopen("stramosi.in", "r", stdin);
	freopen("stramosi.out", "w", stdout);

	scanf("%ld %ld", &n, &m);
	
	for(i = 1; i <= n; ++i)	scanf("%ld", &v[0][i]);

	for (i = 1; i < X; ++i)
		for (j = 1; j <= n; ++j) {
			v[i][j] = v[i - 1][v[i - 1][j]];
		}
	
	for (i = 1; i <= m; ++i)	{
		scanf("%ld %ld", &Q, &P);
		
		
		for (j = 0; j <= X; ++j) {
			if ((P >> j) & 1 == 1) {
				Q = v[j][Q];
			}
		}
		
		printf("%ld\n", Q);
	}

	return 0;
}