#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MaxN = 1e5 + 5;

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