N, M = map(int, input().split())
if M == 0:
	for i in range(N):
		print(N - i)
	exit()
A = list(map(int, input().split()))
B = [[] for _ in range(M)]
C = [-1] * N
for i in range(N):
	if A[i] < M:
		C[i] = len(B[A[i]])
		B[A[i]].append(i)
if any(len(B[i]) == 0 for i in range(M)):
	for i in range(N):
		print(0)
	exit()

last = []
last.append(max(B[i][0] for i in range(M)))
for i in range(1, N):
	if C[i - 1] == -1 or last[-1] == -1:
		last.append(last[-1])
	else:
		if C[i - 1] == len(B[A[i - 1]]) - 1:
			last.append(-1)
		else:
			last.append(max(last[-1], B[A[i - 1]][C[i - 1] + 1]))

# i に対して、A[i], ..., A[j] に 0, 1, ..., M - 1 が全て現れる最小の j が last[i] (存在しなければ -1)
# 累積和

ac = [0] * (N + 1)
for i in range(N):
	if last[i] != -1:
		ac[N - i] -= 1
		ac[last[i] - i] += 1
for i in range(N):
	ac[i + 1] += ac[i]
for i in range(N):
	print(ac[i])