mod=998244353
#N,Q=map(int, input().split())
import heapq 
from heapq import heappop,heappush,heapify
from sys import stdin, setrecursionlimit
input = stdin.readline
readline = stdin.readline

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

C=[0]*(N+2)

D=[0]*M
S=set()
for i in range(M):
  S.add(i)

r=0
for i in range(N):
  while r!=N and len(S)!=0:
    a=A[r]
    if a<M:
      if D[a]==0:
        S.remove(a)
      D[a]+=1 
    r+=1
  if len(S)==0:
    s=r-i;t=N-i
    C[s-1]+=1
    C[t]-=1
  a=A[i]
  if a<M:
    if D[a]==1:
      S.add(a)
    D[a]-=1

for i in range(1,N):
  C[i]+=C[i-1]

for i in range(N):
  print(C[i])