#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

#define Nmax 250010

int N, M, P, Q, Ancestor[19][Nmax];

int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    int i, j;
    scanf("%i %i", &N, &M);
    for(i = 1; i <= N; i++)
        scanf("%i", &Ancestor[0][i]);
    for(i = 1; (1 << i) <= N; i++)
        for(j = 1; j <= N; j++)
            Ancestor[i][j] = Ancestor[i - 1][Ancestor[i - 1][j]];
    for(; M; M --)
    {
        scanf("%i %i", &Q, &P);
        for(i = 0; i < 30; i++)
            if(P & (1 << i))
                Q = Ancestor[i][Q];
        printf("%i\n", Q);
    }
    return 0;
}