import java.util.Scanner;
import java.util.TreeMap;

class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		int[] A = new int[N];
		for(int i=0;i<N;i++)
			A[i] = sc.nextInt();
		TreeMap<Integer,Integer> map = new TreeMap<>();
		int r = 0;
		int[] ans = new int[N+1];
		for(int l=0;l<N;l++){
			if(l==r){
				if(A[r]<M)
					map.merge(A[r],1,Integer::sum);
				r++;
			}
			while(r<N&&map.size()<M){
				if(A[r]<M)
					map.merge(A[r],1,Integer::sum);
				r++;
			}
			if(map.size()>=M){
				ans[r-l-1]++;
				ans[N-l]--;
			}
			if(A[l]<M)
				map.merge(A[l],-1,(a,b)->a+b==0?null:a+b);
		}
		StringBuilder sb = new StringBuilder();
		for(int i=0;i<N;i++){
			sb.append(ans[i]);
			sb.append("\n");
			ans[i+1] += ans[i];
		}
		System.out.print(sb.toString());
	}
}