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

using namespace std;

set<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);
    }
    while (e[nod].size() > 0) {
        int aux = *e[nod].begin();
        e[nod].erase(aux);
        e[aux].erase(nod);
        dfs(aux, 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].insert(aux);
        e[aux].insert(i);
    }

    while(e[0].size() > 0) {
        int aux = *e[0].begin();
        e[aux].erase(0);
        e[0].erase(aux);
        dfs(aux, 0);
    }

    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 {
            if (b == 0) {
                fprintf(fo, "%d\n", a);
            } else {
                li it = p[a].begin();
                for (int j = 1; j < b; j++, it++);
                fprintf(fo, "%d\n", *it);
            }
        }
    }

    return 0;
}