#include <bits/stdc++.h>
#define NMAX 250003
#define log 20

using namespace std;

int n, m;
vector<vector<int> > g(NMAX);
int d[NMAX][log];

void dfs(int nod) {
    for(int i = 1; i < log; i++)
        d[nod][i] = d[d[nod][i-1]][i-1];
    for(int child : g[nod]) {
        dfs(child);
    }
}

int k_ancestor(int x, int y) {
    for(int i = log-1;i >= 0; i--)
        if((1<<i) & y)
            x = d[x][i];
    return x;

}

int main()
{
    freopen("stramosi.in","r",stdin);
    freopen("stramosi.out","w",stdout);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        int t;
        cin >> t;
        g[t].push_back(i);
        d[i][0] = t;
    }
    dfs(0);
    while(m--) {
        int x, y;
        cin >> x >> y;
        cout << k_ancestor(x,y) << '\n';
    }
    return 0;
}