#include <cstdio>
#include <algorithm>
#define maxN 250005
#define logN 22
using namespace std;
int n, i, j, m, dp[logN][maxN];
int x, y, pas;
int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(i = 1; i <= n; i++)
        scanf("%d", &dp[0][i]);
    for(i = 1; i <= logN-1; i++)
        for(j = 1; j <= n; j++)
            dp[i][j] = dp[i-1][dp[i-1][j]];
    while(m--)
    {
        scanf("%d %d", &x, &y);
        pas = 0;
        while(y)
        {
            if(y % 2) x = dp[pas][x];
            pas++;
            y /= 2;
        }
        printf("%d\n", x);
    }
    return 0;
}