#include <fstream>
#include <iostream>

using namespace std;

const int NMAX = 250015;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int N,M,P,Q,x;
int stramos[25][NMAX];
int log[NMAX];

void solve();

int main()
{
    f >> N >> M;
    log[1] = 0;
    for (int i = 2; i <= N; ++i)
        log[i] = log[i/2] + 1;
    for (int i = 1; i <= N; ++i)
    {
        f>>x;
        stramos[0][i] = x;
    }
    for (int i = 1; i <= log[N]; ++i)
        for (int j = 1; j <= N; ++j)
            stramos[i][j] = stramos[i-1][stramos[i-1][j]];
    for (int i = 1; i <= M; ++i)
    {
        f >> Q >> P;
        solve();
    }
    f.close();
    g.close();
}
void solve()
{
    int l;
    int nod = Q;
    while(P != 0)
    {
        l = log[P];
        nod = stramos[l][nod];
        P -= (1<<l);
    }
    g << nod << '\n';
}