#include <bits/stdc++.h>
#define NMAX 250008
#define MMAX 300008

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

int n, m, q, p;
int tata[NMAX], sol[MMAX], lvl[NMAX];
vector <int> G[NMAX];
vector < pair <int, int> > Q[MMAX];

void DFS(int nod, int nivel);

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> tata[i];
        G[tata[i]].push_back(i);
    }

    for (int i = 1; i <= m; i++)
    {
        fin >> q >> p;
        Q[q].push_back({p, i});
    }

    for (int i = 1; i <= n; i++)
        if (tata[i] == 0)
            DFS(i, 0);

    for (int i = 1; i <= m; i++)
        fout << sol[i] << '\n';
    return 0;
}

void DFS(int nod, int nivel)
{
    lvl[nivel] = nod;
    for (auto idx : Q[nod])
    {
        if (idx.first > nivel)
            sol[idx.second] = 0;
        else
            sol[idx.second] = lvl[nivel - idx.first];
    }

    for (auto vf : G[nod])
        DFS(vf, nivel+1);
}