#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
struct binary_lifting{
    struct node{
		int depth, jump, parent;
	};
	vector<node> details;
    binary_lifting(vector<vector<int>>& mat, int root)
        :details(mat.size())
    {
		dfs(root, root, mat);
    }

	void dfs(int node, int parent, vector<vector<int>>& mat) {
		int parent2=details[parent].jump;
		details[node].depth=details[parent].depth+1;
        if(details[parent].depth-details[parent2].depth==details[parent2].depth-details[details[parent2].jump].depth){
           details[node].jump=details[parent2].jump;
        }else{
            details[node].jump=parent;
        }
        details[node].parent=parent;
		for(int it:mat[node]){
			if(it==parent)continue;
			dfs(it,node,mat);
		}
	}
    int kthParent(int node, int k){
		while(k>0 and node>0){
			if(details[node].depth-k<=details[details[node].jump].depth) {
				k-=details[node].depth-details[details[node].jump].depth;
				node=details[node].jump;
			}else{
				k--;
				node=details[node].parent;
			}
		}
		return node;
	}
};
vector<vector<int> > mat;
int main(){
    int n, q;
    fin>>n>>q;
    mat.resize(n+1);
    for(int i=1;i<=n;i++){
        int val;
        fin>>val;
        mat[val].push_back(i);
        mat[i].push_back(val);

    }
    binary_lifting ans(mat, 0);
    for(int i=1;i<=q;i++){
        int nod, k;
        fin>>nod>>k;
        fout<<ans.kthParent(nod,k)<<'\n';
    }
}