#include <bits/stdc++.h>
using namespace std;
#include <atcoder/fenwicktree>
using namespace atcoder;

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<vector<int>> v(M);
    for (int i = 0; i < N; i++) {
        if (A[i] < M) {
            v[A[i]].push_back(i);
        }
    }
    fenwick_tree<int> ft(N);
    for (int i = 0; i < M; i++) {
        if (v[i].empty()) {
            continue;
        }
        ft.add(v[i][0], 1);
    }
    vector<int> imos(N + 2, 0);
    for (int i = 0; i < N; i++) {
        int le = i + 1, ri = N;
        int mn = N + 1;
        while (le <= ri) {
            int mid = le + (ri - le) / 2;
            if (ft.sum(i, mid) == M) {
                ri = mid - 1;
                mn = min(mn, mid);
            } else {
                le = mid + 1;
            }
        }
        if (mn != N + 1) {
            imos[mn - i]++;
            imos[N - i+ 1]--;
        }
        #ifdef hahna
        for (int j = 0; j < N; j++) {
            cout << ft.sum(j, j + 1) << " \n"[j + 1 == N];
        }
        cout << "###" << mn << endl;
        #endif
        if (A[i] >= M) continue;
        auto ub = upper_bound(v[A[i]].begin(), v[A[i]].end(), i);
        if (ub != v[A[i]].end()) {
            ft.add(*ub, 1);
        }
    }
    for (int i = 1; i <= N; i++) {
        imos[i + 1] += imos[i];
    }
    for (int i = 1; i <= N; i++) {
        cout << imos[i] << endl;
    }
    // fenwick tree de l ikou ni hajimete ataiga deta basyowo kanri
    // l wo hidari kara miteitte waga m ni naru tokoro wo nibutan de
    return 0;
}