#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");

const int LMAX = 250005;
int father[LMAX], str[LMAX][20], log2[LMAX], put[20];

int main() {
    int n, m, i,j;
    fin >> n >> m;
    //precalculez
    put[0] = 1;
    for (i = 1; i < 20; i++) {
        put[i] = put[i-1] * 2;
    }
    for (i = 2; i <= n; i++) {
        log2[i] = log2[i/2] + 1;
    }
    for (i = 1; i <= n; i++) {
        fin>>father[i];
        str[i][0] = father[i];
    }
    for (j = 1; j < 20; j++) {
        for (i = 1; i <= n; i++) {
            //stramosul i de ord j este stramosul de ord j-1 al stramosului i de ord j-1
            str[i][j] = str[str[i][j-1]][j-1];
        }
    }
    while (m--) {
        int q, p;
        fin >> q >> p;
        while (p) {
            q = str[q][log2[p]];
            p = p - put[log2[p]];
        }
        fout<<q<<endl;
    }




    fin.close();
    fout.close();

    return 0;
}