#include <iostream>

const int nMax = 250005;

int t[nMax], n, m, nod, k, curr;

using namespace std;

int main() {
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);

    // Input rapid
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
    }

    for (int q = 1; q <= m; q++) {
        cin >> nod >> k;

        curr = nod;
        while(k && curr){
           curr = t[curr];
            k--;
        }
        cout << curr << "\n";
    }
    return 0;
}