#include <stdio.h>
#include <stdlib.h>

#define MAXN 250001

typedef struct membru {
    int idx;
    struct membru *children, *next;
} membru;

membru *members[MAXN];
int roots[MAXN];
int stramosi[MAXN][20];
int q[MAXN];

int N, M, P, Q, R;

membru *newmembru (int idx) {
    membru *m = (membru*) malloc(sizeof(membru));
    m->idx = idx;
    m->children = NULL;
    m->next = NULL;
    return m;
}

void addchild(int f, int c) {
    members[c]->next = members[f]->children;
    members[f]->children = members[c];
    stramosi[c][0] = f;
}

void build_tree() {
    int ql = 0, qr = 1;
    int curr;
    int i;
    membru *c;
    while(ql != qr) {
        curr = q[ql++];
        c = members[curr]->children;
        while (c != NULL) {
            q[qr++] = c->idx;
            c = c->next;
        }

        for (i = 1; i < 20; i++) {
            stramosi[curr][i] = stramosi[stramosi[curr][i-1]][i-1];
        }
    }
}

int ans(int q, int p) {
    int i;
    while (p != 0) {
        for (i = 1; i < 20 && (1 << i) < p; i++);
        i--;
        p -= (1 << i);
        q = stramosi[q][i];
    }
    return q;
}

int main() {
    int i, j, ap, aq;
    FILE *fi = freopen("stramosi.in", "r", stdin);
    FILE *fo = freopen("stramosi.out", "w", stdout);
    scanf("%d %d", &N, &M);
    for (R = 0, i = 1; i <= N; i++) {
        members[i] = newmembru(i);
        scanf("%d", &j);
        if (j != 0) {
            addchild(j, i);
        } else {
            roots[R++] = i;
        }
    }
    for (i = 0; i < R; i++) {
        q[0] = roots[i];
        build_tree();
    }
    for (i = 0; i < M; i++) {
        scanf("%d %d", &aq, &ap);
        printf("%d\n", ans(aq, ap));
    }
    fclose(fi);
    fclose(fo);
    return 0;
}