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

#define Nmax 250010

int N, M, P, Q, Ancestor[19][Nmax];
const int MaxB = 1000000;
char Buf[MaxB];
int Ptr = 0;

inline int GetInt()
{
    int Ans = 0;
    while(!isdigit(Buf[Ptr]))
        if(++Ptr >= MaxB)
            fread(Buf, 1, MaxB, stdin), Ptr = 0;
    while(isdigit(Buf[Ptr]))
    {
        Ans = Ans * 10 + Buf[Ptr] - '0';
        if(++Ptr >= MaxB) fread(Buf, 1, MaxB, stdin), Ptr = 0;
    }
    return Ans;
}

int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    int i, j;
    fread(Buf, 1, MaxB, stdin);
    N = GetInt();
    M = GetInt();
    for(i = 1; i <= N; i++)
        Ancestor[0][i] = GetInt();
    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 --)
    {
        Q = GetInt();
        P = GetInt();
        for(i = 0; i < 30; i++)
            if(P & (1 << i))
                Q = Ancestor[i][Q];
        printf("%i\n", Q);
    }
    return 0;
}