#include <fstream>

const int NMAX = 250015;

using namespace std;

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

int N,M,P,Q,x,ans;
int stramos[25][NMAX];
int Lg[NMAX];

/*void solve()
{
    int l;
    int nod = Q;
    while(P != 0)
    {
        l = Lg[P];
        nod = stramos[l][nod];
        P -= (1<<l);
    }
    g << nod << '\n';
}*/

void caut(int x, int y)
{
    int aux,log2;
    if(y == 0)
        return;

    log2 = Lg[ y ];
    ans = stramos[ log2 ][ x ];
    caut( stramos[ log2 ][ x ] , y - ( 1 << log2) );
}

int main()
{
    f >> N >> M;

    for (int i = 1; i <= N; ++i)
    {
        f >> x;
        stramos[0][i] = x;
    }

    for (int i = 2; i <= N; ++i)
    {
        Lg[i] = Lg[i/2] + 1;
    }

    for (int i = 1; i <= Lg[N]; ++i)
    {
        for (int j = 1; j <= N; ++j)
        {
            stramos[i][j] = stramos[i-1][stramos[i-i][j]];
        }
    }

    for (int i = 1; i <= M; ++i)
    {
        f >> Q >> P;
        caut(Q,P);
        g << ans << '\n';
    }

    f.close();
    g.close();
    return 0;
}