#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int maxn = 250005;
int pozitie[maxn];
int dp[20][maxn];
int v[maxn];

void answer(int q, int p)
{
    int incep = q;
    for(int i = 0; (1 << i) <= p; i++)
        if((p & (1 << i)) != 0)
            incep = dp[i][incep];
    out << incep << "\n";
    return;

}

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

    for(int j = 1; (1 << j) <= n; j++)
    {
        for(int i = 1; i <= n; i++)
        {
            dp[j][i] = dp[j - 1][dp[j - 1][i]];
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int q, p;
        in >> q >> p;
        answer(q, p);
    }

}