#include <cmath>
#include <fstream>

std::ifstream fin("stramosi.in");
std::ofstream fout("stramosi.out");

int n, q;
int dp[250010][19];

int main() {
    fin >> n >> q;
    for (int i = 1; i <= n; i++)
        fin >> dp[i][0];

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

    int log = log2(n);
    for (int it = 0; it < q; it++) {
        int q, p; fin >> q >> p;
        int ancestor = q;
        for (int i = log; i >= 0; i--)
            if (p & (1 << i))
                ancestor = dp[ancestor][i];
        fout << ancestor << '\n';
    }

    fout.close();
    return 0;
}