// Generated by ChatGPT o1-preview (丁寧投げ)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 200005;

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

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

    if (M == 0) {
        // 全ての部分列が条件を満たす
        for (int k = 1; k <= N; ++k) {
            cout << N - k + 1 << "\n";
        }
        return 0;
    }

    vector<int> last(M, -1); // last[x]: 数 x の最後の出現位置
    vector<int> diff(N + 2, 0);

    for (int i = 1; i <= N; ++i) {
        if (A[i] < M) {
            last[A[i]] = i;
        }

        int min_last = INT32_MAX;
        bool all_present = true;
        for (int j = 0; j < M; ++j) {
            if (last[j] == -1) {
                all_present = false;
                break;
            }
            min_last = min(min_last, last[j]);
        }

        if (all_present) {
            int s_i = i - min_last + 1;
            diff[s_i] += 1;
            diff[i + 1] -= 1;
        }
    }

    vector<int> ans(N + 2, 0);
    for (int k = 1; k <= N; ++k) {
        ans[k] = ans[k - 1] + diff[k];
        cout << ans[k] << "\n";
    }

    return 0;
}