#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

vector <int> tata[250002];
vector <int> rez;
vector <pair <int ,int>> queries[300001];
int rezolv[300001];
int q,p;

void dfs (int node){
    rez.push_back(node);
    for(auto i:queries[node]){
        int idx=rez.size()-1-i.first;
        if(idx>0)
            rezolv[i.second]=rez[idx];
    }
    
    for(int i:tata[node]){
        dfs(i);
    }
    rez.pop_back();
    
}

int main() {
    int n,m,a;
    fin>>n>>m;
    for(int i=1;i<=n;i++){
        fin>>a;
        tata[a].push_back(i);
    }
    
    for(int i=1;i<=m;i++){
        fin>>q>>p;
        queries[q].push_back({p,i});
    }
    dfs(0);
    for(int i=1;i<=m;i++){
        fout<<rezolv[i]<<endl;
    }
    return 0;
}