#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
using ll = long long;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;
const int dy[]={0,1,0,-1};
const int dx[]={1,0,-1,0};

int main(){
    int N,M;
    cin>>N>>M;
    vector<int> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }

    vector<ll> ans(N+1,0);
    const int MAXA=2*100000;
    
    vector<int> cnt_appear(MAXA+1,0);

    for(int k=1;k<=N;k++){
        set<int> st;
        cnt_appear.assign(MAXA+1,0);
        for(int t=0;t<=k;t++){
            st.insert(t);
        }
        for(int t=0;t<k;t++){
            cnt_appear[A[t]]++;
            if(st.count(A[t])){
                st.erase(A[t]);
            }
        }
        if(*st.begin()>=M){
            ans[k]++;
        }

        for(int t=k;t<N;t++){
            cnt_appear[A[t-k]]--;
            if(cnt_appear[A[t-k]]==0){
                st.insert(A[t-k]);
            }
            cnt_appear[A[t]]++;
            if(st.count(A[t])){
                st.erase(A[t]);
            }
            if(*st.begin()>=M){
                ans[k]++;
            }
        }

    }

    for(int k=1;k<=N;k++){
        cout<<ans[k]<<endl;
    }
}