#include <fstream>
#include <vector>
#include <cmath>
#include <iostream>
using namespace std;

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

constexpr int maxn = 250000 + 10, maxq = 300000 + 10;
int d[20][maxn], n, m, q, p;

int main()
{
    fin >> n >> m;
    for (int i=1; i<=n; ++i)
    {
        fin >> d[0][i];
    }
    for (int i=1; i<=19; ++i)
    {
        for (int j=1; j<=n; ++j)
        {
            d[i][j] = d[i-1][d[i-1][j]];
        }
    }
    for (int i=1; i<=m; i++)
    {
        fin >> q >> p;
        for (int e=0; e<20; e++)
        {
            if (p&(1<<e))
            {
                q=d[e][q];
            }
        }
        fout << q << '\n';
    }
    return 0;
}