#include <fstream>
#include <vector>
#include <stack>

#define maxn 350005
#define maxm 350005

using namespace std;

ifstream f ("stramosi.in");
ofstream g ("stramosi.out");

struct Query{
    int pos, father;
};

vector < int > root;
vector < Query > q[maxn];
vector < int > v[maxn];
vector < int > stiva;
int sol[maxm];

int n, m;

int DFS(int u){
    stiva.push_back(u);
    for(int i = 0; i < v[u].size(); ++i){
        for(int j = 0; j < q[v[u][i]].size(); ++j){
            if(!q[v[u][i]][j].father) sol[q[v[u][i]][j].pos] = v[u][i];
            if(q[v[u][i]][j].father <= stiva.size()){
                sol[q[v[u][i]][j].pos] = stiva[stiva.size() - q[v[u][i]][j].father];
            }
        }
        DFS(v[u][i]);
    }
    stiva.erase(stiva.begin() + stiva.size() - 1);
}

int main(){
    f >> n >> m;
    for(int i = 1; i <= n; ++i){
        int x;
        f >> x;
        if(x) v[x].push_back(i);
        else root.push_back(i);
    }
    for(int i = 1; i <= m; ++i){
        int vx, ft;
        f >> vx >> ft;
        q[vx].push_back((Query){i, ft});
    }
    for(int i = 0; i < root.size(); ++i){
        DFS(root[i]);
    }
    for(int i = 1; i <= m; ++i) g << sol[i] << '\n';
}