#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n,k,h[N],gr[N];
vi im[N];
set<int> zar[N];

int getNex(int x,int i)
{
	auto it=upper_bound(all(im[x]),i);
	if (it==im[x].end()) return -1;
	return *it;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>k;
	for (int i=0;i<n;++i)
	{
		cin>>h[i];
		if (h[i]==-1) h[i]=0;
		im[h[i]].pb(i);
	}
	for (int a=1;a<=n;++a)
	{
		vi st;
		for (auto x: im[a])
		{
			st.pb(x);
			int ne=getNex(a,x),n0=getNex(0,x);
			while (n0!=-1 && (ne==-1 || n0<ne))
			{
				if (st.size())
				{
					gr[st.back()]=n0;
					st.pop_back();
				}
				n0=getNex(0,n0);
			}
		}
		for (auto x: st) gr[x]=n;
	}
	set<pii> cu; //r,l
	set<int> uz;
	for (int i=0;i<n;++i) if (h[i]) uz.insert(i);
	for (int i=0;i<n;++i)
	{
		if (h[i])
		{
			cu.insert({gr[i],i});
			zar[gr[i]].insert(i);
			if ((int)cu.size()>k)
			{
				int mak=cu.rbegin()->y;
				cu.erase({gr[mak],mak});
				zar[gr[mak]].erase(mak);
				uz.erase(mak);
			}
		}
		else
		{
			for (auto x: zar[i]) cu.erase({gr[x],x});
		}
	}
	cout<<uz.size()<<en;
	for (auto x: uz) cout<<x+1<<' ';
	cout<<en;
}