#include <iostream>
#include <cmath>
using namespace std;
int maxim, n, m, contor = 0, sum = 0, copsum, v[102], i, j; bool sortat = 0;
int main()
{
cin >> n >> m;
for(i = 1; i <= n; ++i)
{
  cin >> v[i];
  sum += v[i];
  if(sum <= m)
  {
    cout << 0 << ' ';
  }
  else
  {
    copsum = sum;
    sortat = 0;
    contor = 0;
    while(!sortat)
    {
      sortat = 1;
      for(j = 1; j < i - 1; ++j)
        if(v[j] > v[j + 1])
          {
            sortat = 0;
            swap(v[j], v[j + 1]);
          }
    }
    for(j = i - 1; j >= 1 && copsum > m; --j)
    {
      copsum -= v[j];
      ++contor;
    }
    cout << contor << ' ';
  }
}
  return 0;
}