#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	while(cin >> N) {
		vi S(N+1);
		rep(i, N+1) cin >> S[i];
		int M = S[N];
		int dp[11][11];
		rer(i, 0, N) rer(j, 0, M)
			dp[i][j] = INF;
		dp[0][0] = 1;
		rer(i, 0, N) rer(j, 0, M) if(i > 0 || j > 0) {
			if(S[i] < j) continue;
			int x = INF;
			if(i > 0) amin(x, dp[i-1][j] + 1);
			rer(k, 0, j-1)
				amin(x, dp[i][k] + dp[i][j-1-k]);
			dp[i][j] = x;
		}
		rer(i, 0, M) {
			if(i != 0) putchar(' ');
			printf("%d", dp[N][i]);
		}
		puts("");
	}
	return 0;
}