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

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

const int MAXN = 250005;
int n, m, father[MAXN], 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 i = 1; i <= n; ++i) dp[i][0] = father[i];
    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 pas = log[k];
    while (k) {
        if (1 << pas <= k) {
            x = dp[x][pas];
            k -= 1 << pas;
        }
        pas--;
    }
    return x;
}

int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; ++i) in >> father[i];
    preprocess();

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

    return 0;
}