#include <iostream>
#include <fstream>
using namespace std;

ifstream in("stramosi.in");
ofstream out("stramosi.out");

const int L = 1 << 17;
const int MAXN = 250005;
int n, m, log[MAXN];
int dp[MAXN][18];

void preprocess() {
    log[1] = 0;
    for (int i = 2; i <= n; ++i) {
        log[i] = log[i / 2] + 1;
    }

    for (int j = 1; j <= 17; ++j) {
        for (int i = 1; i <= n; ++i) {
            dp[i][j] = dp[dp[i][j - 1]][j - 1];
        }
    }
}

/*int query(int x, int k) {
    int mask = 1 << log[k];
    for (int i = log[k]; i >= 0; --i) {
        if ((mask & k) != 0) {
            x = dp[x][i];
        }
        mask >>= 1;
    }
    return x;
}*/

int query(int q, int p) {
    int step = L;
    int lg = 17;
    int pos = 0;
    while (step) {
        if (pos + step <= p) {
            pos += step;
            q = dp[q][lg];
        }
        step /= 2;
        lg--;
    }

    //if (p % 2 != 0) return dp[0][q];

    return q;
}

int main()
{

    in >> n >> m;
    for (int i = 1; i <= n; ++i) in >> dp[i][0];
    preprocess();

    for (int i = 1; i <= m; ++i) {
        int x, k;
        in >> x >> k;
        out << query(x, k) << "\n";
    }

    return 0;
}