#include <bits/stdc++.h>

using namespace std;

#define MAX_N 250000
#define pb push_back

int n, m, L;
bitset <MAX_N + 1> viz;
vector <int> roots;
vector <vector <int> > up, graph;

void dfs(int node, int parent)
{
//    cout << node << " ";
    viz[node] = 1;
    up[node][0] = parent;
    for(int i = 1; i <= L; i ++)
        up[node][i] = up[up[node][i - 1]][i - 1];

    for(auto x : graph[node])
    {
        if(!viz[x])
            dfs(x, node);
    }
}

int ancestor(int a, int b)
{
//    cout << a << " " << b << "\n";
    for(int i = L; i >= 0; i --)
    {
        if(b >= (1 << i))
        {
//            cout << i << "\n";
            a = up[a][i];
            b -= (1 << i);
        }
    }
//    cout <<"\n";
    return a;
}

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);

    cin >> n >> m;
    graph.resize(n + 1);
    L = log2(n);
    up.assign(n + 1, vector <int> (L + 1));

    for(int i = 1; i <= n; i ++)
    {
        int x;
        cin >> x;
        graph[x].pb(i);
    }

    dfs(0, 0);
//    cout << "\n";
//
//    for(int node = 1; node <= n; node ++)
//    {
//        cout << node << "\n";
//        for(int i = 0; i <= L; i ++)
//            cout << i << " " << up[node][i] << "\n";
//        cout << "\n";
//    }

    for(int node = 1; node <= n; node ++)
    {
        for(int i = 1; i <= L; i ++)
            up[node][i] = up[up[node][i - 1]][i - 1];
    }

    for(int i = 1; i <= m; i ++)
    {
        int a, b;
        cin >> a >> b;
        cout << ancestor(a, b) << "\n";
    }
    return 0;
}