#include <bits/stdc++.h>

using namespace std;

#define N 250000

int ma[20][N+1];

int main()
{
    ifstream cin ("stramosi.in");
    ofstream cout ("stramosi.out");

    int n,q,l,c,a,b,i,j;

    cin >> n >> q;

    for (c=1; c<=n; c++)
        cin >> ma[0][c];

    for (l=1; l<=18; l++)
        for (c=1; c<=n; c++)
            ma[l][c]=ma[l-1][ma[l-1][c]];

    for (i=0; i<q; i++){
        cin >> a >> b;
        for (j=0; j<=29; j++)
            if (b&(1<<j))
                a=ma[j][a];

        cout << a << '\n';
    }

    return 0;
}