#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long int MOD = 1009;
long long int mpow(long long int a, long long int b) {
  if (b == 0) return 1;
  long long int t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long int modinverse(long long int a, long long int m) {
  long long int m0 = m;
  long long int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long int q = a / m;
    long long int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long int range(long long int l, long long int r) {
  return l + rand() % (r - l + 1);
}
using cd = complex<double>;
const double PI = acos(-1);
long long int reverse(long long int num, long long int lg_n) {
  long long int res = 0;
  for (long long int i = 0; i < lg_n; i++) {
    if (num & (1 << i)) res |= 1 << (lg_n - 1 - i);
  }
  return res;
}
void fft(vector<cd>& a, bool invert) {
  long long int n = a.size();
  long long int lg_n = 0;
  while ((1 << lg_n) < n) lg_n++;
  for (long long int i = 0; i < n; i++) {
    if (i < reverse(i, lg_n)) swap(a[i], a[reverse(i, lg_n)]);
  }
  for (long long int len = 2; len <= n; len <<= 1) {
    double ang = 2 * PI / len * (invert ? -1 : 1);
    cd wlen(cos(ang), sin(ang));
    for (long long int i = 0; i < n; i += len) {
      cd w(1);
      for (long long int j = 0; j < len / 2; j++) {
        cd u = a[i + j], v = a[i + j + len / 2] * w;
        a[i + j] = u + v;
        a[i + j + len / 2] = u - v;
        w *= wlen;
      }
    }
  }
  if (invert) {
    for (cd& x : a) x /= n;
  }
}
void multiply(vector<long long int>& a, vector<long long int> const& b) {
  vector<cd> fa(a.begin(), a.end()), fb(b.begin(), b.end());
  long long int n = 1;
  while (n < a.size() + b.size()) n <<= 1;
  fa.resize(n);
  fb.resize(n);
  fft(fa, false);
  fft(fb, false);
  for (long long int i = 0; i < n; i++) fa[i] *= fb[i];
  fft(fa, true);
  a.clear();
  a.resize(n);
  double eps = 0.1;
  for (long long int i = 0; i < n; i++) {
    a[i] = ((long long int)(fa[i].real() + eps));
  }
}
int main() {
  long long int n, x;
  cin >> n >> x;
  vector<long long int> arr;
  long long int counter = 0;
  for (long long int i = 1; i <= n; i++) {
    counter++;
    long long int temp;
    cin >> temp;
    if (temp < x) {
      arr.push_back(counter);
      counter = 0;
    }
  }
  arr.push_back(counter + 1);
  long long int m = (long long int)arr.size();
  vector<long long int> brr(m);
  for (long long int i = 0; i < m; i++) brr[i] = arr[m - i - 1];
  vector<long long int> ans(n + 2, 0);
  for (long long int i = 0; i < m - 1; i++) {
    ans[0] += arr[i] - 1 + ((arr[i] - 1) * (arr[i] - 2)) / 2;
  }
  ans[0] += arr[m - 1] - 1 + ((arr[m - 1] - 1) * (arr[m - 1] - 2)) / 2;
  multiply(arr, brr);
  for (long long int i = 1; i <= m - 1; i++) {
    ans[i] = arr[m - 1 - i];
  }
  for (long long int i = 0; i < n + 1; i++) cout << ans[i] << " ";
  return 0;
}
