#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 666013
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 1005
int N,M,i,j,D[18][250005];
int main()
{
    freopen("stramos.in","r",stdin);
    freopen("stramos.out","w",stdout);
    scanf("%d %d",&N,&M);
    for (i=1;i<=N;i++) scanf("%d",&D[0][i]);
    for (i=1;i<=17;i++)
        for (j=1;j<=N;j++)
            D[i][j]=D[i-1][D[i-1][j]];
    while (M--)
    {
        int Q,P;
        scanf("%d %d",&Q,&P);
        int lvl=0;
        while (P>0)
        {
            if (P&1) Q=D[lvl][Q];
            lvl++;
            P>>=1;
        }
        printf("%d\n",Q);
    }
    return 0;
}