#include <bits/stdc++.h>
using namespace std;

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

const int maxn = 250000;
int dp[maxn + 1][20];
int n, m, nod, ord;

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> dp[i][0];

    for (int j = 1; (1 << j) < n; ++j)
    {
        for (int i = 1; i <= n; ++i)
        {
            dp[i][j] = dp[dp[i][j - 1]][j - 1];
        }
    }
    while (m--) {
        fin >> nod >> ord;
        int j = 0;
        while ((1 << j) <= ord) ++j;
        int nc = dp[nod][--j];
        while (nc != 0 && j) {
            --j;
            if (ord & (1 << j)) nc = dp[nc][j];
        }
        fout << nc << '\n';
    }
    return 0;
}