#include <stdio.h>
#define maxl 250010

int n,m,i,j,k,p,q;
int c[maxl][20];

void solve(int p, int q)
{
    if (!q)
    {
        printf("0\n");
        return;
    }
    for (i=0; i<=20; i++)
        if (p==(1<<i))
        {
            printf("%d\n",c[q][i]);
            return;
        }
        else if (p<(1<<i))
             {
                solve(p-(1<<(i-1)),c[q][i-1]);
                return;
             }
}

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

    scanf("%d %d",&n,&m);
    for (i=1; i<=n; i++)
        scanf("%d ",&c[i][0]);

    for (j=1; j<=20; j++)
    {
        if ((1<<j)>n) break;
        for (i=1; i<=n; i++)
            c[i][j]=c[c[i][j-1]][j-1];
    }

    while (m>0)
    {
        m--;
        scanf("%d %d",&q,&p);

        solve(p,q);
    }
    

    return 0;
}