#include <bits/stdc++.h>

using namespace std;

const int LOG = 18;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int>> t(n + 1, vector<int>(LOG, 0));
    for (int i = 1; i <= n; i++)
        cin >> t[i][0];
    /// t[i][j] = t[t[i][j - 1]][j - 1]
    for (int j = 1; j <= LOG; j++)
        for (int i = 1; i <= n; i++)
            t[i][j] = t[t[i][j - 1]][j - 1];
    function<void(int, int)> jump = [&](int q, int p)
    {
        for (int j = LOG; j >= 0; j--)
            if ((p >> j) & 1)
                q = t[q][j];
        cout << q << '\n';
    };
    for (int que = 1, q, p; que <= m; que++)
    {
        cin >> q >> p;
        jump(q, p);
    }
}

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

    ios :: sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    return 0;
}