#include <bits/stdc++.h>
#define N 250005

using namespace std;

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

int n, m;
int dp[N][20], lg2[N];
int nivel[N];

void calcLog()
{
    for (int i = 1; i < N; i++)
        lg2[i] = lg2[i / 2] + 1;
}

void calcDp()
{
    for (int k = 1; k <= lg2[n]; k++)
    {
        for (int nod = 1; nod <= n; nod++)
            if (dp[nod][k - 1] == 0)
                dp[nod][k] = 0;
            else
                dp[nod][k] = dp[dp[nod][k - 1]][k - 1];
    }

}

inline int p2(int x)
{
    return (1 << x);
}

void Query(int nod, int pos, int p)
{
    if (pos == p)
    {
        fout << nod << "\n";
        return;
    }
    else
    {
        int st = 0, dr = lg2[n], mij;
        while (st <= dr)
        {
            mij = (st + dr) / 2;
            if (pos + p2(mij) == p)
                break;
            else if (pos + p2(mij) < p)
                st = mij + 1;
            else
                dr = mij - 1;
        }

        Query(dp[nod][mij], pos + p2(mij), p);
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> dp[i][0];
        nivel[i] = nivel[dp[i][0]] + 1;
    }
    calcLog();
    calcDp();

    for (int i = 1; i <= m; i++)
    {
        int q, p;
        fin >> q >> p;
        Query(q, 0, p);
    }
    return 0;
}