#include <fstream>
using namespace std;

struct Nod
{
    int parent;
    int value;
};

int main()
{
    ifstream in("stramosi.in");
    ofstream out("stramosi.out");
    int N;
    int M;
    int i;
    int ancestor;
    int nod, rang;
    Nod* Graph;

    in >> N >> M;
    Graph = new Nod[N + 1];

    for (i = 1; i <= N; ++i)
    {
        in >> ancestor;

        Graph[i].value = i;
        Graph[i].parent = ancestor;
    }

    for (i = 1; i <= M; ++i)
    {
        in >> nod >> rang;

        int p;
        Nod traveller = Graph[nod];

        for (p = 1; p <= rang && traveller.parent != 0; ++p)
            traveller = Graph[traveller.parent];

        if (traveller.parent == 0 && p < rang)
            out << "0\n";
        else
            out << traveller.value << "\n";
    }

    delete[] Graph;

    return 0;
}