#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 250005;
const int lmax = 20;

int n, m, i, j, k, p, q, lim;
int dp[lmax][nmax];

void precalc()
{
    for(i = 1, k = 2; k <= n; i++, k <<= 1)
        for(j = 1; j <= n; j++)
            dp[i][j] = dp[i - 1][dp[i - 1][j]];

    lim = i - 1;
}

int query(int p, int q) // count the p-th ancestor of node q
{
    for(i = lim; i >= 0; i--)
        if((1 << i) & p)
            q = dp[i][q];

    return q;
}

int main()
{
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);

    scanf("%d%d", &n, &m);
    for(i = 1; i <= n; i++)
        scanf("%d", &dp[0][i]);

    precalc();

    for(; m; m--)
    {
        scanf("%d%d", &q, &p);
        printf("%d\n", query(p, q));
    }

    return 0;
}