#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 <cmath>
#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];
	int t[(int) log2(n + 1)][n + 1];
	t[0][0] = 0;
	for (int i = 1; i <= n; i++) {
		input >> t[0][i];
	}
	cout << log2(n) << endl;
	cout << (int) log2(n) + 1 << endl;

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

	output.close();
	return 0;
}