#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
vector< vector<int> > a;
vector<bool> use;
queue<int> q;
int st[250005],top,n,t,dp[25][250005],lg[250005];
void dfs(int x)
{
    st[++top]=x;
    if(use[x]==false)
    {
        for(int i=1;(1<<i)<top;i++)
            dp[i][x]=st[top-(1<<i)];
        use[x]=true;
    }
    for(vector<int>::iterator i=a[x].begin();i!=a[x].end();i++)
        dfs(*i);
    top--;
}
int query(int x,int k)
{
    if(k==0)return x;
    else return query(dp[lg[k]][x],k-(1<<lg[k]));
}
int main()
{
    in>>n>>t;
    a=vector< vector<int> > (n+1);
    use=vector<bool> (n+1);
    for(int i=1;i<=n;i++)
    {
        int x;
        in>>x;
        a[x].pb(i);
        dp[0][i]=x;
        if(x==0)
            q.push(x);
        if(i>=2)
            lg[i]=lg[i/2]+1;
    }
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        dfs(x);
    }
    for(;t;t--)
    {
        int x,y;
        in>>x>>y;
        out<<query(x,y)<<'\n';
    }
    return 0;
}