#include<cstdio>
#include<vector>

using namespace std;

const int nmax=250005;

int dp[22][nmax],n;

inline void offline()
{
    int i,j;
    for(i=1;i<=18;++i)
        for(j=1;j<=n;++j)
            dp[i][j]=dp[i-1][dp[i-1][j]];
}

inline int query(int child,int nr)
{
    int step=1<<18,lg=18,i;
    for(i=0;step;step>>=1,--lg)
        if(i+step<=nr)
        {
            i+=step;
            child=dp[lg][child];
        }
    return child;
}

int main()
{
    freopen("stramosi.in","r",stdin);
    freopen("stramosi.out","w",stdout);
    int q,i,j;
    scanf("%d%d",&n,&q);
    for(i=1;i<=n;++i)
        scanf("%d",&dp[0][i]);
    offline();
    int child,nr;
    while(q--)
    {
        scanf("%d%d",&child,&nr);
        printf("%d\n",query(child,nr));
    }
}