#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,m;
    cin>>n>>m;
    vector<int> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    vector<int> cnt(3e5,0);

    int r = 0;
    vector<ll> ans(n+1,0);
    int now = m;

    auto add = [&](int p) {
        if(p>=m) return;
        //cout<<p<<" "<<cnt[p]<<endl;
        if(cnt[p]==0) now--;
        cnt[p]++;
        return;
    };
    auto erase = [&](int p){
        if(p>=m) return;
        if(cnt[p]==1) now++;
        cnt[p]--;
    };
    for(int i = 0;i<n;i++){
        while(r<=i) {
            add(a[r]);
            r++;
        }
        while(r<n){
            if(now==0) break;
            //cout<<i<<" "<<r<<endl;
            add(a[r]);
            r++;
        }
        
        if(now==0) {
            int len = r - i;
            int mx = n - i;
            ans[len]++;
            if(mx+1<=n) ans[mx+1]--;
        }
        erase(a[i]);
    }
    for(int i = 1;i<=n;i++){
        if(i!=n) ans[i+1] += ans[i];
        cout<<ans[i]<<endl;
    }
    
}