#include <bits/stdc++.h>

using namespace std;

int q, p, n, m;
vector<vector<int>> t(250001, vector<int>(19, 0));

void jump(int q, int p)
{
    for (int j = log2(n + 1); j >= 0; j--)
        if ((p >> j) & 1)
            q = t[q][j];
    cout << q << '\n';
}

void solve()
{
    cin >> n >> m;
    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 <= log2(n + 1); j++)
        for (int i = 1; i <= n; i++)
            t[i][j] = t[t[i][j - 1]][j - 1];
    for (int que = 1; 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;
}