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

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

const int L = 18;

int n, m;
int dp[20][250005];

void preprocess() {
    for (int k = 1; k <= 18; ++k) {
        for (int j = 1; j <= n; ++j) {
            dp[k][j] = dp[k-1][dp[k-1][j]];
        }
    }
}

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

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

    return q;
}

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


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

    return 0;
}