#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ld, ld> pdd;
typedef pair<int, int> pii;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, b;
	cin >> n >> b;
	vector<int> a(n);
	vector<int> ini(n);
	vector<vector<int>> pos(n);
	set<int> avs;
	int cm1 = 0;
	for (int i = 0; i < n; i++) {
		cin >> ini[i];
		if (ini[i] == -1) {
			vector<int> to_er;
			for (auto x : avs) {
				a[pos[x].back()] = cm1;
				pos[x].pop_back();
				if (pos[x].empty())
					to_er.push_back(x);
			}
			for (auto x : to_er)
				avs.erase(x);
			cm1++;
		} else {
			ini[i]--;
			pos[ini[i]].push_back(i);
			if (pos[ini[i]].size() == 1)
				avs.insert(ini[i]);
		}
	}

	for (int i = 0; i < n; i++) {
		reverse(all(pos[i]));
		for (int j = 0; j < pos[i].size(); j++)
			a[pos[i][j]] = cm1 + j;
	}

	avs.clear();
	set<pii, greater<pii>> pq;
	vector<set<int>> pos2(n);
	vector<set<int>> vs(n);
	vector<int> ans;
	int act_sz = 0;
	for (int i = 0; i < n; i++) {
		if (ini[i] == -1) {
			vector<int> to_er;
			for (auto x : avs) {
				int p = *pos2[x].begin();
				ans.push_back(p);
				if (pq.count(pii(*vs[x].begin(), x))) {
					pq.erase(pii(*vs[x].begin(), x));
				}
				vs[x].erase(vs[x].begin());
				pos2[x].erase(p);
				if (pos2[x].empty()) {
					to_er.push_back(x);
				}
				act_sz--;
			}
			for (auto x : to_er)
				avs.erase(x);
		} else {
			if (act_sz == b) {
				auto xx = *pq.begin();
				int x = xx.second;
				vs[x].erase(*vs[x].rbegin());
				pos2[x].erase(*pos2[x].begin());
				pq.erase(xx);
				if (pos2[x].empty())
					avs.erase(x);
				else
					pq.insert(pii(*vs[x].rbegin(), *pos2[x].begin()));
				act_sz--;
			}
			int x = ini[i];
			int v = a[i];
			pos2[x].insert(i);
			vs[x].insert(v);
			if (pos2[x].size() == 1) {
				avs.insert(x);
				pq.insert(pii(v, x));
			}
			act_sz++;
		}
	}

	for (int i = 0; i < n; i++)
		for (auto x : pos2[i])
			ans.push_back(x);

	sort(all(ans));

	cout << ans.size() << "\n";
	for (int i = 0; i < ans.size(); i++)
		cout << ans[i] + 1 << " \n"[i + 1 == ans.size()];

	return 0;
}