#include<cstdio>
#pragma GCC optimize("Ofast")
using namespace std;

const int NMAX = 250055;
const int LOG_MAX = 20;
int stramosi[NMAX][LOG_MAX + 10]; // stramosi[i][j] = al 2^j-lea stramos al nodului i;

void ComputeStramosi(int n) {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= LOG_MAX; j++) {
            stramosi[i][j] = stramosi[stramosi[i][j - 1]][j - 1];
        }
    }
}
int MSB(int x) {
    return 31 - __builtin_clz(x);
}
int query(int q, int p) {
    int stramos = q;
    while (p != 0) {
        if (stramos == 0) {
            break;
        }

        int jump_positions = MSB(p);
        stramos = stramosi[stramos][jump_positions];
        p -= (1 << jump_positions);
    }
    return stramos;
}

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

    int n, queries;

    scanf("%d%d", &n, &queries);

    for (int i = 1; i <= n; i++) {
        scanf("%d", &stramosi[i][0]);
    }

    ComputeStramosi(n);

    for (; queries > 0; queries--) {
        int q, p;
        scanf("%d%d", &q, &p);
        printf("%d\n", query(q, p));
    }

    return 0;
}