#include<stdio.h>
#include<vector>
#define mp make_pair
#define pb push_back
#define popb pop_back
#define maxn 350000
#define maxm 400000
using namespace std;

int n,m,u;
int v[maxn],sol[maxm];
int stack[maxn];
vector <int> l[maxn],root;
vector < pair<int,int> > t[maxn];

void read()
{
    int i;
    int node,father;
    int x;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if(x!=0)
        {
            l[x].pb(i);
            l[i].pb(x);
        }
        else root.pb(i);
    }
    for(i=1;i<=m;i++) { scanf("%d%d",&node,&father); t[node].pb(mp(father,i)); }
}

void dfs(int start)
{
    int k,ok;
    stack[++u]=start; v[start]=1;
    while(u>0)
    {
        ok=0;
        k=stack[u];
        for(unsigned int i=0;i<t[k].size();i++)
        {
            if(u-t[k][i].first>0) sol[t[k][i].second]=stack[u-t[k][i].first];
            else sol[t[k][i].second]=0;
        }

        for(unsigned int i=0;i<l[k].size();i++)
            if(v[l[k][i]]==0)
            {
                v[l[k][i]]=1;
                stack[++u]=l[k][i];
                ok=1;
                break;
            }
        if(ok==0) u--;
    }
}

void solve()
{
    for(unsigned int i=0;i<root.size();i++)
      { u=0; dfs(root[i]); }
}

void print()
{
    for(int i=1;i<=m;i++) printf("%d\n",sol[i]);
}

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

    read();
    solve();
    print();

    fclose(stdin);
    fclose(stdout);
    return 0;
}