import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353

n,m=LI()
aa=LI()

if m==0:
    for a in range(n,0,-1):print(a)
    exit()

cnt=[0]*m
kind=0

ans=[0]*(n+1)
r=0
for l in range(n):
    while r<n and kind<m:
        a=aa[r]
        if a<m:
            cnt[a]+=1
            if cnt[a]==1:kind+=1
        r+=1
    if kind==m:
        ans[r-l-1]+=1
        ans[n-l]-=1
    a=aa[l]
    if a<m:
        cnt[a]-=1
        if cnt[a]==0:kind-=1

for i in range(n-1):ans[i+1]+=ans[i]
for a in ans[:-1]:print(a)