#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repp(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)

typedef long long LL;
typedef long double LD;

int main(){
  LL n,t;
  cin >> n >> t;
  LL sum=0;
  LL h;
  LL pre=0,presum=0;
  rep(i,n){
    cin >> h;
    if(pre<h){
      sum+=presum+pre;
      cout << max(0LL,t-sum)/h+1 << endl;
      presum=0;
      pre=h;
    }else{
      presum+=h;
      cout << max(0LL,t-sum-presum)/pre+1 << endl;
    }
  }
  return 0;
}

