#include <bits/stdc++.h>
using namespace std;
ifstream fin ("stramosi.in");
ofstream fout ("stramosi.out");

int n, m;
int p[250001], dp[18][250001]; //al 2^i-lea stramos

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

    for (int i = 1; i <= 18; i++)
        for (int node = 1; node <= n; node++)
            dp[i][node] = dp[i - 1][dp[i - 1][node]];

    while (m--)
    {
        int node, p;
        fin >> node >> p;

        for (int k = 0; k <= 18; k++)
            if ((p & (1 << k)) > 0)
                node = dp[k][node];

        fout << node << '\n';
    }
    return 0;
}