#include <bits/stdc++.h>
#define nmax 250005

using namespace std;

int n, Q;
int d[19][nmax];
/// d[i][j]=stramosul lui j aflat la distanta 2^i

int main ()
{
    int i, j, nod, mos, p;
    ifstream fin ("stramosi.in");
    ofstream fout("stramosi.out");
    fin >> n >> Q;
    for (i = 1; i <= n; i++)
        fin >> d[0][i];

    for (i = 1; i <= 18; i++)
        for (j = 1; j <= n; j++)
            d[i][j] = d[i-1][d[i-1][j]];

    for (i = 1; i <= Q; i++)
    {
        fin >> nod >> mos;
        p = 0;
        while (mos > 0)
        {
            if (mos % 2 == 1) nod = d[p][nod];
            p++;
            mos /= 2;
        }
        fout << nod << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}