#include <cstdio>

#define NMAX 250007
#define LMAX 20

using namespace std;

int D[LMAX][NMAX];
int n, m;

inline int solve(int A, int B){
    for(int i = 0; (1 << i) <= B; ++ i)
        if((1 << i) & B)
            A = D[i][A];
    return A;
}

int main(){
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &D[0][i]);
    for(int i = 1; (1 << i) <= n; ++i)
        for(int j = 1; j <= n; ++j)
            D[i][j] = D[i - 1][D[i - 1][j]];
    for(int i = 1; i <= m; ++i){
        int a, b;
        scanf("%d %d", &a, &b);
        printf("%d\n", solve(a, b));
    }
    return 0;
}