#include <bits/stdc++.h>

using namespace std;

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

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 250000 + 5;

vector < int > a[N];

int dad[25][N], parent[N], high[N];
bool f[N];

void dfs(int k)
{
    f[k] = true;
    for(auto v : a[k]) {
        if(f[v] == false) {
            high[v] = high[k] + 1;
            dfs(v);
        }
    }
}

void binary_lift(int n)
{
    for(int i = 1; i <= n; ++i) {
        for(int j = 0; j <= 22; ++j) {
            dad[i][j] = -1;
        }
    }
    for(int i = 1; i <= n; ++i) {
        if(parent[i] != 0) dad[i][0] = parent[i];
    }
    for(int j = 1; (1 << j) <= n; ++j) {
        for(int i = 1; i <= n; ++i) {
            if(dad[i][j - 1] != -1) {
                dad[i][j] = dad[dad[i][j - 1]][j - 1];
            }
        }
    }
}

int find_asc(int k, int lvl)
{
    if(high[k] <= lvl) return 0;
    for(int i = 22; i >= 0 && lvl > 0; --i) {
        if(lvl >= (1 << i) && dad[k][i] != -1) k = dad[k][i], lvl -= (1 << i);
    }
    return k;
}

int main()
{
    usain_bolt();

    int n, q;

    fin >> n >> q;
    for(int i = 1; i <= n; ++i) {
        fin >> parent[i];
        if(parent[i] > 0) {
            a[parent[i]].push_back(i);
            a[i].push_back(parent[i]);
        }
        high[i] = 1;
    }
    binary_lift(n);
    for(int i = 1; i <= n; ++i) {
        if(parent[i] == 0) {
            dfs(i);
        }
    }
    for(int i = 1; i <= q; ++i) {
        int x, y;

        fin >> x >> y;
        fout << find_asc(x, y) << "\n";
    }
    return 0;
}