#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int dp[20][250005],n,lg[250005];
int query(int x,int k)
{
    if(k==0)return x;
    else return query(dp[lg[k]][x],k-(1<<lg[k]));
}
int main()
{
    int q;
    in>>n>>q;
    for(int i=1;i<=n;i++)
    {
        in>>dp[0][i];
        if(i>=2)
            lg[i]=lg[i/2]+1;
    }
    for(int i=1;(1<<i)<=n;i++)
    for(int j=1;j<=n;j++)
        dp[i][j]=dp[i-1][ dp[i-1][j] ];
    for(;q;q--)
    {
        int x,k;
        in>>x>>k;
        out<<query(x,k)<<'\n';
    }
    return 0;
}