/* -*- coding: utf-8 -*-
 *
 * 2930.cc:  No.2930 Larger Mex - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_M = 200000;

/* typedef */

/* global variables */

int as[MAX_N];
int cs[MAX_M], ds[MAX_N + 2];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  if (m == 0) {
    for (int k = n; k >= 1; k--) printf("%d\n", k);
    return 0;
  }
  
  int x = 0;
  for (int i = 0, j = 0; i < n; i++) {
    while (j < n && x < m) {
      if (as[j] < m && cs[as[j]]++ == 0) x++;
      j++;
    }
    if (x < m) break;

    ds[j - i]++, ds[n - i + 1]--;

    if (as[i] < m && --cs[as[i]] == 0) x--;
  }

  for (int k = 1; k <= n; k++) {
    ds[k] += ds[k - 1];
    printf("%d\n", ds[k]);
  }
  
  return 0;
}