#include <iostream>

using namespace std;
int n,i,pw,m,nod,p;
int d[20][250001];

int main()
{
    cin>>n>>m;
    for (i=1;i<=n;i++) cin>>d[0][i];
    for (pw=1;pw<=17;pw++)
    {
        for (i=1;i<=n;i++) d[pw][i]=d[pw-1][d[pw-1][i]];
    }
    for (i=1;i<=m;i++)
    {
        cin>>nod>>p;
        for (pw=0;pw<=17;pw++)
        {
            if (p&(1<<pw)) nod=d[pw][nod];
        }
        cout<<nod<<"\n";
    }
}