#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <typename T>
void etch(T V) {
  for (auto x : V) cout << x << ' ';
  cout << '\n';
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) long long int idx,
               __attribute__((unused)) long long int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, long long int idx, long long int LINE_NUM,
               Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
const long long int MOD = 1e9 + 7;
const long long int MOD1 = 998244353;
const long long int N = 2e5 + 5;
const long long int INF = 1000111000111000111LL;
const long double EPS = 1e-12;
const long double PI = 3.141592653589793116;
using cd = complex<double>;
void fft(vector<cd>& a, bool invert) {
  long long int n = a.size();
  if (n == 1) return;
  vector<cd> a0(n / 2), a1(n / 2);
  for (long long int i = 0; 2 * i < n; i++) {
    a0[i] = a[2 * i];
    a1[i] = a[2 * i + 1];
  }
  fft(a0, invert);
  fft(a1, invert);
  double ang = 2 * PI / n * (invert ? -1 : 1);
  cd w(1), wn(cos(ang), sin(ang));
  for (long long int i = 0; 2 * i < n; i++) {
    a[i] = a0[i] + w * a1[i];
    a[i + n / 2] = a0[i] - w * a1[i];
    if (invert) {
      a[i] /= 2;
      a[i + n / 2] /= 2;
    }
    w *= wn;
  }
}
vector<long long int> multiply(vector<long long int> const& 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);
  vector<long long int> result(n);
  for (long long int i = 0; i < n; i++) result[i] = round(fa[i].real());
  return result;
}
int32_t main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, x;
  cin >> n >> x;
  vector<long long int> a(n), pre(n + 1, 0), fre(n + 1, 0);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] = (a[i] < x) ? 1 : 0;
  }
  for (long long int i = 1; i <= n; i++) {
    pre[i] = pre[i - 1] + a[i - 1];
  }
  for (long long int& x : pre) fre[x]++;
  vector<long long int> rev_fre = fre, sub_sums, ans(n + 1, 0);
  reverse((rev_fre).begin(), (rev_fre).end());
  sub_sums = multiply(fre, rev_fre);
  ans[0] = (sub_sums[n] - (n + 1)) / 2;
  for (long long int i = 1; i <= n; i++) {
    ans[i] = sub_sums[n + i];
  }
  etch(ans);
  return 0;
}
