#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
int main(){
	LL n,t;
	cin>>n>>t;
	LL sum = 0, Max = 0;
	for(int i = 1; i <= n; i++){
		LL x;
		cin>>x;
		sum += x;
		Max = max(Max,x);
		LL ans = 1;
		if(t >= sum) ans = floor((t-sum)/Max)+2;
		printf("%lld\n",ans);
	}
	return 0;
}
