#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

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

const int LMAX = 250005;
const int NMAX = 300005;
vector<int> L[LMAX], st;
vector<pair<int, int>> QER[LMAX];
int sol[NMAX];

void dfs(int node) {
    st.push_back(node);
    for (pair<int, int> q : QER[node]) { //trec prin toate intrebarile legat de node
        int p = st.size() - 1 - q.first;
        if (p >= 0) {
            sol[q.second] = st[p];
        }
    }
    for (int vec : L[node]) {
        dfs(vec);
    }
    st.pop_back();
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x;
        fin >> x;
        L[x].push_back(i);
    }
    for (int i = 0; i < m; i++) {
        int p, q;
        fin >> q >> p;
        QER[q].push_back({p, i});
    }
    dfs(0);
    for (int i = 0; i < m; i++) {
        fout<<sol[i]<<endl;
    }



    fin.close();
    fout.close();

    return 0;
}