#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;

int main()
{
	LL n, t;
	while (~scanf("%lld%lld", &n, &t)) {
		LL sum = 0, MaX = 0;
		for (int i = 1; i <= n; i++) {
			LL x; scanf("%lld", &x);
			sum += x; MaX = max(MaX, x);
			LL ans = 1;
			if (t >= sum) ans = (LL)floor((t - sum) * 1.0 / MaX) + 2;
			printf("%lld\n", ans);
		}
	}	
	return 0;
}
