//
// Created by cteam24 on 11/27/21.
//

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

using namespace std;

int main() {
    int n, q, tmp;
    cin >> n >> q;

//    vector<int> predecessor(n);
//    vector<int> loaves_cnt(n, 0);
    vector<queue<int> > successor(n);
    for (int i = 1; i < n; ++i) {
        cin >> tmp;
//        predecessor[i] = tmp;
        successor[tmp].push(i);
    }

    for (int i = 0; i < q; ++i) {
        int gate = 0;
        while (!successor[gate].empty()) {
            tmp = successor[gate].front();
            successor[gate].pop();
            successor[gate].push(tmp);
            gate = tmp;
        }
        // loaves_cnt[gate]++;
        cout << gate << endl;
    }

//    for (int loaves:loaves_cnt)
//        cout << loaves << endl;


}