#include <cstdio>
#include <cmath>
#define Nmax 250005

using namespace std;

int N,tata[Nmax],dp[Nmax][25];

inline void RMQ()
{
    int i,j;
    for(i=1;i<=N;++i)
        dp[i][0]=tata[i];
    for(i=1;i<=N;++i)
        for(j=1;j<=20;++j)
            dp[i][j]=dp[dp[i][j-1]][j-1];
}

inline int Put(int x)
{
    int i;
    for(i=0;(1<<i)<x;++i);
    return i;
}

int main()
{
    int M,x,y,i,p;
    freopen ("stramosi.in","r",stdin);
    freopen ("stramosi.out","w",stdout);
    scanf("%d%d", &N,&M);
    for(i=1;i<=N;++i)
        scanf("%d", &tata[i]);
    RMQ();

    while(M--)
    {
        scanf("%d%d", &x,&y);
        while(y)
        {
            p=log2(y);
            x=dp[x][p];
            y-=(1<<p);
        }
        printf("%d\n", x);
    }
    return 0;
}