#include <bits/stdc++.h>
#define N 250005

using namespace std;

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

int n, m;
int dp[N][20], lg2[N];

void calcLog()
{
    for (int i = 1; i < N; i++)
        lg2[i] = lg2[i / 2] + 1;
}

void calcDp()
{
    for (int k = 1; k <= lg2[n]; k++)
    {
        for (int nod = 1; nod <= n; nod++)
            if (dp[nod][k - 1] == 0)
                dp[nod][k] = 0;
            else
                dp[nod][k] = dp[dp[nod][k - 1]][k - 1];
    }

}

inline int p2(int x)
{
    return (1 << x);
}

int Query(int nod, int p)
{
    int nodAns = nod;

    for (int i = 0; i <= lg2[p]; i++)
    {
        if (p & p2(i))
            nodAns = dp[nodAns][i];
    }

    return nodAns;
}

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

    calcLog();
    calcDp();

    for (int i = 1; i <= m; i++)
    {
        int q, p;
        fin >> q >> p;
        fout << Query(q, p) << "\n";
    }
    return 0;
}