#include <iostream>
#include <vector>
#include <algorithm>

#define pii pair<int,int>
#define X first
#define Y second
using namespace std;

vector<vector<int> > x;
vector<int> m, apa, kov, res;
vector<bool> kell;
vector<pii> s;
int N, ans = -1, K;

void kiir() {
	for (int i = 1; i <= N; ++i)
		cout << m[i] << ' ' << kell[i] << ' ' << kov[i] << '\n';

	for (auto e : s)
		cout << e.X << ' ' << e.Y << '\n';
}

void mely(int csp){
	
	if (x[csp].empty()) {
		kell[csp] = true;
		kov[csp] = 0;
		m[csp] = 1;
		return;
	}

	int p = x[csp][0];

	for (auto e : x[csp]) {
		mely(e);
		if (m[p] < m[e]) p = e;
	}

	kell[p] = false;
	kell[csp] = true;
	m[csp] = m[p] + 1;
	kov[csp] = p;
}

bool r(const pii& a, const pii& b) { return a.X > b.X; }

int main()
{
	cin >> N >> K;
	x.resize(N + 1), m.resize(N + 1), apa.resize(N + 1);
	kell.resize(N + 1, false), kov.resize(N + 1, 0);

	for (int i = 1; i <= N; ++i) {
		cin >> apa[i];
		if (apa[i] != 0) x[apa[i]].push_back(i);
	}

	mely(1);
	for (int i = 1; i <= N; ++i)
		if (kell[i]) s.push_back({ m[i],i });

	//kiir();

	sort(s.begin(), s.end(), r);
	
	if (K > s.size()) K = s.size();

	for (int i = 0; i < K; ++i) {
		int p = s[i].Y;
		ans += m[p];
		while (kov[p]) p = kov[p];
		res.push_back(p);
	}

	cout << ans << '\n';
	for (auto e : res) cout << e << ' ';

	return 0;
}