#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");

#define nmax 250010

int n, m, q, p;
int dp[18][nmax], pw[nmax];

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        f >> dp[0][i];
    }
    for (int i = 1; i < 18; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            dp[i][j] = dp[i - 1][dp[i - 1][j]];
            // if (dp[i - 1][j] )
            // {
            //     dp[i][j] = dp[i - 1][dp[i - 1][j]];
            // }
        }
    }
    for (int i = 2; i <= n; ++i)
    {
        pw[i] = pw[i / 2] + 1;
    }
    for (int i = 1; i <= m; ++i)
    {
        f >> q >> p;
        int t = q;
        while (p)
        {
            int x = p & (-p);
            p -= x;
            x = pw[x];
            t = dp[x][t];
        }
        g << t << '\n';
    }
    return 0;
}