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

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

int n, m, dp[NMAX + 5][20];

int Query(int x, int y)
{
    stack <int> pos;
    int p = 0;
    while (y)
    {
        if (y % 2 == 1)
            pos.push(p);
        y = y / 2;
        ++p;
    }
    int sol = 0;
    while (pos.size() > 0)
    {
        p = pos.top();
        pos.pop();
        sol = dp[x][p];
        x = dp[x][p];
    }
    return sol;
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        int val;
        fin >> val;
        dp[i][0] = val;
    }
    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--)
    {
        int x, y;
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}