#include <iostream>
#include <fstream>

using namespace std;

#define NMAX 250005
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n;
int dp[20][NMAX];

int cautbin (int q, int p) {
    int step;
    if (p == 1) return dp[0][q];
    for (step = 1; (1 << step) <= p; ++step);
    step--;
    //if ((1 << step) == p) return dp[step][q];
    while (p > 0) {
        p -= (1 << step);
        q = dp[step][q];
        step--;
    }
    return q;
}

int main()
{
    int m, i, j;
    f >> n >> m;
    for (i = 1; i <= n; ++i) {
        f >> dp[0][i];
    }

    for (j = 1; j <= n; ++j)
    for (i = 1; i <= 18; ++i)
            dp[i][j] = dp[i - 1][dp[i - 1][j]];

    int p, q;
    for (i = 1; i <= m; ++i) {
        f >> q >> p;
        g << cautbin(q, p) << "\n";

    }
    return 0;
}