#include <iostream>
#include <fstream>

using namespace std;

ifstream f("stramosi.in");
ofstream g("stramosi.out");

int dp[18][250010], n, nod, m, nr;

int str(int nod, int ordin) {
    int i = 0;
    while (ordin != 0) {
        if (ordin % 2) {
            nod = dp[i][nod];
        }
        ordin /= 2;
        ++i;
    }
    return nod;
}

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

    for (int i = 1; i <= m; ++i) {
        f >> nod >> nr;
        g << str(nod, nr) << '\n';
    }

    return 0;
}