#include <bits/stdc++.h>
#define NMAX 250003
#define log 19

using namespace std;

int n, m;
int d[NMAX][log];

int k_ancestor(int x, int y) {
    for(int i = log-1;i >= 0; i--)
        if((1<<i) & y)
            x = d[x][i];
    return x;

}

int main()
{
    freopen("stramosi.in","r",stdin);
    freopen("stramosi.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i = 1; i <= n; i++) {
        int t;
        scanf("%d",&t);
        d[i][0] = t;
        for(int j = 1; j < log; j++)
            d[i][j] = d[d[i][j-1]][j-1];
    }
    while(m--) {
        int x, y;
        scanf("%d %d",&x,&y);
        printf("%d\n",k_ancestor(x,y));
    }
    return 0;
}