#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <string>
#include <algorithm>
#include <iterator>
#include <iostream>
#include <cassert>
#include <stdio.h>
#include <iostream>
#include <fstream>
using namespace std;

int main()
{
	ifstream input("stramosi.in");
	ofstream output("stramosi.out");

	int n,k;
	input >> n >> k;
	int d[n+1];
	for ( int i=1; i<=n; i++){
		input >> d[i];
	}
	int start, stop;
	for ( int i=1; i<=k; i++){
		input >> start >> stop;
		int pos = start;
		for ( int j=1; j<=stop; j++){
			pos = d[pos];
			if ( pos==0 ) break;
		}
		output<< pos << "\n";
	}


	output.close();
	return 0;
}