#include <fstream>
#include <vector>

#define MAXN 250005

using namespace std;

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

vector < int > v[MAXN];
vector < int > sol[MAXN];
vector < int > stiva;

int n, m;
bool used[MAXN];

int DFS(int l, int u){
    used[u] = 1;
    stiva.push_back(u);
    int k = v[u].size();
    for(int i = 0; i < k; ++i){
        int nod = v[u][i];
        for(int j = stiva.size() - 1; j >= 0; --j){
                int m = stiva[j];
                sol[nod].push_back(m);
            }
        DFS(l, nod);
    }
    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);
    }
    for(int i = 1; i <= n; ++i){
        if(!used[i])
            DFS(0, i);
    }
    for(int i = 1; i <= m; ++i){
        int x, y;
        f >> x >> y;
        if(y < sol[x].size() + 1 && !sol[x].empty()) g << sol[x][y-1] << '\n';
        else g << 0 << '\n';
    }
}