#include <fstream>
#include <cmath>

using namespace std;

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

const int MAX_N = 250000;

int d[18][MAX_N+1], n, m;

int main()
{
    int i, j, log;
    in >> n >> m;
    for(j = 1; j <= n; j++)
    {
        in >> d[0][j];
    }
    log = log2(n);
    for(i = 1; i <= log; i++)
    {
        for(j = 1; j <= n; j++)
        {
            d[i][j] = d[i-1][d[i-1][j]];
        }
    }
    int q, p;
    for(j = 1; j <= m; j++)
    {
        in >> q >> p;
        i = 0;
        while(p != 0)
        {
            if(p%2 != 0)
            {
                q = d[i][q];
            }
            i++;
            p /= 2;
        }
        out << q << "\n";
    }
    return 0;
}