#include <bits/stdc++.h>
using namespace std;
void fft(vector<complex<double> > &a, bool inv) {
  int n = a.size(), j = 0;
  vector<complex<double> > roots(n / 2);
  for (int i = 1; i < n; i++) {
    int bit = (n >> 1);
    while (j >= bit) {
      j -= bit;
      bit >>= 1;
    }
    j += bit;
    if (i < j) swap(a[i], a[j]);
  }
  double ang = 2 * acos(-1) / n * (inv ? -1 : 1);
  for (int i = 0; i < n / 2; i++) {
    roots[i] = complex<double>(cos(ang * i), sin(ang * i));
  }
  for (int i = 2; i <= n; i <<= 1) {
    int step = n / i;
    for (int j = 0; j < n; j += i) {
      for (int k = 0; k < i / 2; k++) {
        complex<double> u = a[j + k], v = a[j + k + i / 2] * roots[step * k];
        a[j + k] = u + v;
        a[j + k + i / 2] = u - v;
      }
    }
  }
  if (inv)
    for (int i = 0; i < n; i++) a[i] /= n;
}
vector<long long int> multiply(vector<long long int> &v,
                               vector<long long int> &w) {
  vector<complex<double> > fv(v.begin(), v.end()), fw(w.begin(), w.end());
  int n = 2;
  while (n < v.size() + w.size()) n <<= 1;
  fv.resize(n);
  fw.resize(n);
  fft(fv, 0);
  fft(fw, 0);
  for (int i = 0; i < n; i++) fv[i] *= fw[i];
  fft(fv, 1);
  n = v.size() + w.size() - 1;
  vector<long long int> ret(n);
  for (int i = 0; i < n; i++) ret[i] = (long long int)round(fv[i].real());
  return ret;
}
long long int a[200005], s[200005];
vector<long long int> A, B;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  int n, x;
  cin >> n >> x;
  A.resize(n + 1);
  B.resize(n + 1);
  A[0] = 1;
  for (int i = 1; i <= n; i++) {
    int y;
    cin >> y;
    a[i] = (y < x);
    s[i] = s[i - 1] + a[i];
    A[s[i]]++;
  }
  for (int i = 0; i <= n; i++) B[i] = A[n - i];
  B = multiply(A, B);
  long long int cnt = 0;
  long long int r0 = 0;
  a[n + 1] = 1;
  for (int i = 1; i <= n + 1; i++) {
    if (a[i] == 0) {
      cnt++;
    } else {
      r0 += cnt * (cnt + 1) / 2;
      cnt = 0;
    }
  }
  cout << r0 << " ";
  for (int i = 1; i <= n; i++) cout << B[i + n] << " ";
  return 0;
}
