#include <bits/stdc++.h>
#define N 250005
#define lg 17

using namespace std;

int n, m;
int dp[N][20];

void calcDp()
{
    for (int k = 1; k <= lg; k++)
    {
        for (int nod = 1; nod <= n; nod++)
            if (dp[nod][k - 1] == 0)
                dp[nod][k] = 0;
            else
                dp[nod][k] = dp[dp[nod][k - 1]][k - 1];
    }

}

int Query(int nod, int p)
{
    int nodAns = nod;

    for (int i = 0; i <= lg; i++)
    {
        if (p & (1 << i))
            nodAns = dp[nodAns][i];
    }

    return nodAns;
}

int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);

    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        int x;
        scanf("%d", &x);
        dp[i][0] = x;
    }

    calcDp();

    for (int i = 1; i <= m; i++)
    {
        int q, p;
        scanf("%d%d", &q, &p);
        printf("%d\n", Query(q, p));
    }
    return 0;
}