#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>

using namespace std;
/* *
 *
 * Too many mind, no mind.
 *
 * */
const int maxn = 3e5 + 10;
int children[maxn], order[maxn], par[maxn], ans[maxn];
long long freq[maxn];
vector <int> tree[maxn];
void dfs(int u, int prev = 0) {
	for (int& v : tree[u]) {
		if (v == prev) continue;
		freq[v] = 1ll * freq[u] * (tree[u].size() - (prev != u));
		dfs(v, u);
	}
}
void dfs2(int u, int prev = 0, long long pos = 0) {
	if (pos > maxn) return;
	if (children[u] == 0) {
		long long i = pos;
		while (i < maxn) {
			ans[i] = u;
			i += freq[u];
		}
	}
	for (int& v : tree[u]) {
		if (v == prev) continue;
		long long newpos = pos + 1ll * order[v] * freq[u];
		dfs2(v, u, newpos);
	}
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int n, q; cin >> n >> q;
	for (int i = 1; i < n; i++) {
		cin >> par[i];
		order[i] = children[par[i]];
		children[par[i]]++;
		tree[i].push_back(par[i]);
		tree[par[i]].push_back(i);
	}
	freq[0] = 1;
	dfs(0);
	dfs2(0);
	for (int i = 0; i < q; i++) cout << ans[i] << '\n';
	return 0;
}