#include<bits/stdc++.h>
using namespace std;

int n,m,A[50010],T[50010];
long long l = 0,r = 0,mid,ans; 
bool check(long long m_d) {
	long long happy = 0,day = 0;
	for (int i = 1;i <= n + 1 && day < m;) {
		if (happy >= m_d) {
			day++;
			happy = happy / 2;
			continue;
		}
		else {
			happy = happy + A[i];
			i++;
		}
	}
	if (day >= n) return 1;
	else return 0;
}
void pt(long long m_d) {
	long long happy = 0,day = 0;
	int i;
	for (i = 1;i <= n + 1 && day < m;) {
		if (happy >= m_d) {
			day++;
			happy = happy / 2;
		}
		else {
			happy = happy + A[i];
			T[i] = day + 1;
			i++;
		}
	}
	for (int j = i;j <= n;j++) {
		T[j] = m;
	}
}
int main()
{
	cin >> n >> m;
	for (int i = 1;i <= n;i++) {
		cin >> A[i];
		r = r + A[i];
	}	
	while(l <= r){
		mid = (l + r) / 2;
		if(check(mid)){
			ans = mid;
			l = mid + 1;
		}
		else{
			r = mid - 1;
		}
	}
	cout<<ans<<endl;
	pt(ans);
	for(int i=1;i<=n;i++) {
		cout<<T[i]<<endl;
	}
	return 0;
}