#include <bits/stdc++.h>

using namespace std;

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

vector<int> lg2;
vector<vector<int>> G, ancestor;

void dfs(int node, int parent) {
    ancestor[node][0] = parent;
    for(int i = 1; i < 20; ++i)
        ancestor[node][i] = ancestor[ancestor[node][i - 1]][i - 1];
    for(int next : G[node])
        if(next != parent)
            dfs(next, node);
}

void min_self(int &a, int b) {
    a = min(a, b);
}

int up(int node, int jumps) {
    if(jumps == 0 || node == 0)
        return node;
    return up(ancestor[node][lg2[jumps]], jumps - (1 << lg2[jumps]));
}

int main() {
    int N, Q;
    fin >> N >> Q;
    G.resize(N + 1);
    vector<int> roots;
    for(int i = 1; i <= N; ++i) {
        int t;
        fin >> t;
        if(t)
            G[t].emplace_back(i);
        else
            roots.emplace_back(i);
    }
    ancestor = vector<vector<int>>(N + 1, vector<int>(20));
    for(int root : roots)
        dfs(root, 0);
    lg2.resize(N + 1);
    for(int i = 2; i <= N; ++i)
        lg2[i] = lg2[i / 2] + 1;
    while(Q--) {
        int node, jumps;
        fin >> node >> jumps;
        fout << up(node, jumps) << '\n';
    }
}