#include <algorithm>
// #include <bits/stdc++.h>
#include <deque>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <set>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false), cin.tie(0);
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define sz(a) (ll) a.size()
#define all(x) x.begin(), x.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define lowbit(x) x &(-x)

const ll MAXN = 1e5 + 5;
// const ll MAXM = 1e2 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;

ll N, T;
ll h[MAXN], pre[MAXN], preMax[MAXN];

void solve(){
  cin >> N >> T;  
  for(int i = 1; i <= N; i++){
    cin >> h[i];
    pre[i] = pre[i-1] + h[i];
    preMax[i] = max(preMax[i-1], h[i]);
  }
  for(int i = 1; i <= N; i++){
    if(T == 0 || (T < pre[i])){
      cout << "1\n";
    }
    else cout << max((T - pre[i]), 0ll) / preMax[i] + 2 << "\n";
  }
}

signed main() {
  fastio ll T = 1;
  // cin >> T;
  for (ll i = 1; i <= T; i++) {
    solve();
  }
  return 0;
}