class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    # T.sum(0, x) <= kとなる最大のxを返す。
    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x

    def __str__(self):
        temp = []
        for i in range(self._n):
            temp.append(str(self.sum(i, i + 1)))
        return ' '.join(temp)


N, M = map(int, input().split())
A = list(map(int, input().split()))
if M == 0:
    for i in range(N):
        print(N - i)
    exit()

K = 2 * 10 ** 5 + 5
cnt = [0] * K
now = 0
T = Fenwick_Tree(K)
while now != N and T.sum(0, M) != M:
    cnt[A[now]] += 1
    if cnt[A[now]] == 1:
        T.add(A[now], 1)
    now += 1

ans = [0] * (N + 2)
for i in range(N):
    if T.sum(0, M) == M:
        ans[now - i] += 1
        ans[N - i + 1] -= 1
    cnt[A[i]] -= 1
    if cnt[A[i]] == 0:
        T.add(A[i], -1)
    while now != N and T.sum(0, M) != M:
        cnt[A[now]] += 1
        if cnt[A[now]] == 1:
            T.add(A[now], 1)
        now += 1
    
for i in range(N):
    ans[i + 1] += ans[i]

for a in ans[1:-1]:
    print(a)