#include <bits/stdc++.h>

using namespace std;

#if 1
    #define pv(x) std::cerr<<#x<<" = "<<(x)<<"; ";std::cerr.flush()
    #define pn std::cerr<<std::endl
#else
    #define pv(x)
    #define pn
#endif

#ifdef INFOARENA
    ifstream in("stramosi.in");
    ofstream out("stramosi.out");
#else
    #define in cin
    #define out cout
#endif

using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld, ld>;
#define pb push_back
const double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
const int inf_int = 1e9 + 5;
const ll inf_ll = 1e18 + 5;
const int NMax = 3e5 + 5;
const int dx[] = {-1,0,0,+1}, dy[] = {0,-1,+1,0};
const double EPS = 1e-8;

int ans[NMax];
bool vis[NMax];
vector<int> stk;
vector<pii> query[NMax];
vector<int> adj[NMax];

void dfs(int node) {
    
    for (pii p : query[node]) {
        int pth = p.first, idx = p.second;
        if (pth > (int)stk.size()) {
            ans[idx] = 0;
        }
        else {
            pth = (int)stk.size() - pth;
            ans[idx] = stk[pth];
        }
    }

    stk.pb(node);

    for (int nxt : adj[node]) {
        dfs(nxt);
    }

    stk.pop_back();
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);

    int N, M;
    in >> N >> M;
    for (int i = 1; i <= N; ++i) {
        int dad;
        in >> dad;
        adj[dad].pb(i);
    }

    for (int i = 1; i <= M; ++i) {
        int node, pth;
        in >> node >> pth;
        query[node].pb({pth, i});
    }

    dfs(0);

    for (int i = 1; i <= M; ++i) {
        out << ans[i] << '\n';
    }

    return 0;
}