#include <cstdio>
#include <vector>
#define NMAX 250005
#define MMAX 300005

using namespace std;

struct mmm
{
    int x,y;
}q[MMAX];

int n, m, k, x;
int st[NMAX], tata[NMAX], niv[NMAX], poz[MMAX];
bool viz[NMAX];
vector<int>v[NMAX],sol[NMAX],a[NMAX];

void DFS(int nod)
{
    int i;

    x=nod;
    viz[x]=1;
    niv[x] = niv[tata[x]] + 1;
    st[++k]=x;

    if (a[x].size() != 0)
    {
        for(i = 0; i < a[x].size() ;++i)
            if (k - a[x][i] >= 0) sol[x].push_back(st[k - a[x][i]]);
                else sol[x].push_back(0);
    }

    for(i = 0; i < v[nod].size(); ++i)
        if (viz[v[nod][i]] == 0) DFS(v[nod][i]);

    --k;
}

int main()
{
    freopen("stramosi.in","r",stdin);
    freopen("stramosi.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= n; ++i)
    {
        scanf("%d",&x);
        if (x != 0)
        {
            v[x].push_back(i);
            tata[i] = x;
        }
    }

    for(int i = 1; i <= m; ++i)
    {
        scanf("%d%d",&q[i].x,&q[i].y);
        a[q[i].x].push_back(q[i].y);
        poz[i] = a[q[i].x].size() - 1;
    }

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

    for(int i = 1; i <= m; ++i)
        printf("%d\n",sol[q[i].x][poz[i]]);

    return 0;
}