#include <bits/stdc++.h>

using namespace std;

ifstream fin("stramosi.in");
ofstream fout("stramosi.out");

int n, m, x, y, dp[250005][20], logg[250005];

int Query(int a, int b)
{
    int putere = (1 << logg[b]);
    if (putere == b)
    {
        return dp[a][logg[b]];
    }
    return Query(dp[a][logg[b]], b - putere);
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        int nod;
        fin >> nod;
        dp[i][0] = nod;
    }
    for (int i = 2; i <= n; ++i)
    {
        logg[i] = 1 + logg[i / 2];
    }
    for (int j = 1; j <= 18; ++j)
    {
        for (int i = 1; i <= n; ++i)
        {
            dp[i][j] = dp[dp[i][j - 1]][j - 1];
        }
    }
    while (m--)
    {
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}