//0010
#include <cstdio>
#include <list>
#define li list<int>::iterator

using namespace std;

list<int> e[25005];
list<int> p[25005];

void dfs(int nod, int root) {
    p[nod].push_back(root);
    for (li it = p[root].begin(); it != p[root].end(); it++) {
        p[nod].push_back(*it);
    }
    for (li it = e[nod].begin(); it != e[nod].end(); it++) {
        if (*it == root) {
            continue;
        }
        dfs(*it, nod);
    }
}

int main() {
    FILE* fi = fopen("stramosi.in", "rt");
    FILE* fo = fopen("stramosi.out", "wt");

    int n, m;
    fscanf(fi, "%d%d", &n, &m);

    for (int i = 1; i <= n; i++) {
        int aux;
        fscanf(fi, "%d", &aux);
        e[i].push_back(aux);
        e[aux].push_back(i);
    }

    for (li it = e[0].begin(); it != e[0].end(); it++) {
        for (li jt = e[*it].begin(); jt != e[*it].end(); jt++) {
            if (*jt == 0) {
                continue;
            }
            dfs(*jt, *it);
        }
    }

    for (int i = 0; i < m; i++) {
        int a, b;
        fscanf(fi, "%d%d", &a, &b);
        if (b > p[a].size()) {
            fprintf(fo, "0\n");
        } else {
            li it = p[a].begin();
            for (int j = 1; j < b; j++, it++);
            fprintf(fo, "%d\n", *it);
        }
    }

    return 0;
}