// compile: make data
// run: time ./data < data.in > data.out
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
#else
#define debug(x...)
#define Debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

int p[MAXN][30];

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    const int N = 30;
    int n, q; cin >> n >> q;
    // vector<vector<int>> p(n, vector<int>(N));
    rep(i, 0, n) cin >> p[i][0], --p[i][0];
    rep(j, 1, N) {
        rep(i, 0, n) p[i][j] = p[p[i][j - 1]][j - 1];
    }
    while (q--) {
        int u, k; cin >> u >> k; --u;
        for (int i = N-1; i >= 0; --i) {
            if (k & (1 << i)) {
                u = p[u][i];
            }
        }
        printf("%lld\n", u+1);
    }

    return 0;
}