#include <bits/stdc++.h>
#define NMAX 250010

using namespace std;

ifstream fin("date.in");
ofstream gout("date.out");

int tata[NMAX][30], n, m, a, poz;
int search_ancestor(int a, int poz)
{
    int index = 0;
    while (poz)
    {
        if (poz % 2)
            a = tata[a][index];
        poz >>= 1;
        ++index;
    }
    return a;
}

int main()
{
    fin >> n >> m;
    for(int i = 1 ; i <= n ; ++i)
    {
        fin >> a;
        tata[0][i] = a;
    }

    for (int i = 1 ; i <= int(log2(n)) ; ++i)
        for (int j = 1 ; j <= n ; ++j)
            tata[i][j] = tata[i - 1][tata[i - 1][j]];

    for (int i = 1 ; i <= m ; ++i)
    {
        fin >> a >> poz;
        gout << search_ancestor(a, poz) << '\n';
    }


    return 0;
}