#include <bits/stdc++.h>
using namespace std;
int INF = (int)1e9;
long long INFINF = (long long)1e18 + 10;
const long double PI = 3.14159265358979323846;
long long powermodm(long long x, long long n, long long mod) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return result;
}
long long GCD(long long, long long);
long long LCM(long long, long long);
long long power(int, int);
long long choose(long long, long long);
int ones(long long);
void extendedEuclid(long long, long long);
long long MMI(long long, long long);
void fastscan(int &);
bool checkithbit(long long, long long);
bool ispossible(vector<pair<int, int> > ar, int idex) {
  ar.erase(ar.begin() + idex);
  int diff = ar[1].first - ar[0].first;
  for (int i = 2; i < ar.size(); i++) {
    if (ar[i].first - ar[i - 1].first != diff) {
      return 0;
    }
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  map<int, int> make_pair;
  vector<int> a(n), ans;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      make_pair[a[i]]++;
      ans.push_back(0);
    } else {
      int rem = m - a[i];
      int cnt = 0;
      int f = 0;
      for (auto j : make_pair) {
        int occr = j.second;
        int amount = j.first;
        if (rem - (occr * amount) >= 0) {
          rem -= (occr * amount);
          cnt += occr;
          continue;
        } else {
          while (occr > 0 && rem - amount >= 0) {
            rem -= amount;
            occr--;
            cnt++;
          }
        }
        if (occr != 0) {
          f = 1;
          ans.push_back(i - cnt);
          break;
        }
      }
      if (f == 0) {
        ans.push_back(0);
      }
      make_pair[a[i]]++;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}
bool checkithbit(long long a, long long i) {
  if (a & (1 << i)) {
    return true;
  } else {
    return false;
  }
}
long long GCD(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
  return (max(a, b) / GCD(a, b)) * min(a, b);
}
long long power(int a, int n) {
  unsigned long long int result = 1, x = a;
  while (n > 0) {
    if (n % 2 == 1) result = result * x;
    x = x * x;
    n = n / 2;
  }
  return result;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
int ones(long long n) {
  int c = 0;
  while (n) {
    n = n & (n - 1);
    c++;
  }
  return c;
}
long long d, x, y;
void extendedEuclid(long long A, long long B) {
  if (B == 0) {
    d = A;
    x = 1;
    y = 0;
  } else {
    extendedEuclid(B, A % B);
    int temp = x;
    x = y;
    y = temp - (A / B) * y;
  }
}
long long MMI(long long a, long long p) {
  extendedEuclid(a, p);
  if (d == 1 && p != 1)
    return ((x % p) + p) % p;
  else
    return -1;
}
void fastscan(int &number) {
  bool negative = false;
  register int c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
