#include <bits/stdc++.h>
using namespace std;

int n,m;
int d[20][250005];
int main(){
    freopen("stramosi.in", "r", stdin);
    freopen("stramosi.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n ; ++i) scanf("%d", &d[0][i]);
    for(int lg = 1; (1<< lg) <= n ; ++lg){
        for(int j = 1; j <= n ; ++j){
            d[lg][j] = d[lg - 1][d[lg - 1][j]];
        }
    }
    int q, p;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d", &q, &p);
        int p2 = 1, lg = 0;
        while(p2 <= p) ++lg, p2 = p2 << 1;
        p2 = p2 >> 1; --lg;
        while(p > 0){
            if(p >= p2){
                q = d[lg][q];
                p -= p2;
            }
            --lg; p2 = p2 >> 1;
        }
        printf("%d\n", q);
    }

    return 0;
}