#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI a(n);
  rep(i, n) cin >> a[i];
  constexpr int INF = 1001001001;
  segtree<int, [](int x, int y) { return min(x, y); }, []() { return INF; }> seg(VI(200010, 0));
  VI ans(n + 2);
  int r = 0;
  rep(l, n) {
    while (r < n && seg.max_right(0, [](int x) { return x > 0; }) < m) {
      seg.set(a[r], seg.get(a[r]) + 1);
      r++;
    }
    if (seg.max_right(0, [](int x) { return x > 0; }) < m) break;
    ans[r - l]++;
    ans[n - l + 1]--;
    if (r == l) r++;
    else {
      seg.set(a[l], seg.get(a[l]) - 1);
    }
  }
  rep(i, n + 1) ans[i+1] += ans[i];
  for (int i = 1; i <= n; i++) cout << ans[i] << '\n';
}