#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
#define rep(i, n) for (int i = 0; i< (int)(n); i++) 

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m; cin >> n >> m;
    vector<int> a(n); rep(i, n)cin >> a[i];
    if(m == 0){
        rep(i, n)cout << n - i << endl;
        return 0;
    }
    vector<int> ans(n+1, 0), cnt(m, 0);
    int itr = 0; int sz = 0;
    rep(i, n){
        while(itr < n && sz < m){
            if(a[itr] < m){
                if(cnt[a[itr]] == 0)sz++;
                cnt[a[itr]]++;
            }
            itr++;
        }
        if(sz == m){
            ans[itr-i]++;
            if(i > 0)ans[n + 1-i]--;
        }
        if(a[i] < m){
            cnt[a[i]]--;
            if(cnt[a[i]] == 0)sz--;
        }
    }
    int res = 0;
    rep(i, n){
        res += ans[i+1];
        cout << res << endl;
    }

    return 0;
}