#include <fstream>
#include <vector>
#include <queue>
using namespace std;

int n, m;
int t[250001];

void solve() {
    int i, x, Q, P;

    ifstream f("stramosi.in");
    f >> n >> m;
    for (i = 1; i <= n; i++) {
        f >> x;
        t[i] = x;
    }

    ofstream g("stramosi.out");
    for (i = 1; i <= m; i++) {
        f >> Q >> P;
        while (Q != 0 && P > 0) {
            Q = t[Q];
            P--;
        }
        g << Q << '\n';
    }
    g.close();
}

int main() {
    solve();
    return 0;
}