#include <cstdio>

using namespace std;

int n, q, dp[250010][20], nod, dist;

int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    scanf("%d%d", &n, &q);
    for(int i=1; i<=n; i++) scanf("%d", &dp[i][0]);
    for(int i=1; i<=18; i++)
        for(int j=1; j<=n; j++) dp[j][i] = dp[dp[j][i-1]][i-1];
    for(int j=1; j<=q; j++)
        {   scanf("%d%d", &nod, &dist);
            for(int i=0; (1<<i)<=dist; i++) if(dist & (1 << i)) nod = dp[nod][i];
            printf("%d\n", nod);
        }
    return 0;
}