#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    if (M == 0) {
        for (ll i = 0; i < N; i++) {
            cout << N - i << endl;
        }
        return 0;
    }
    vector<vector<ll>> idx(200001, vector<ll>(0));
    for (ll i = 0; i < N; i++) {
        idx[A[i]].push_back(i);
    }
    vector<ll> now_idx(M, 0);
    bool has_zero = false;
    for (ll i = 0; i < M; i++) {
        if (idx[i].size() == 0) {
            has_zero = true;
        }
        now_idx[i] = 0;
    }
    if (has_zero) {
        for (ll i = 0; i < N; i++) {
            cout << 0 << endl;
        }
        return 0;
    }
    vector<ll> ans(N + 1, 0);
    ll now_max_idx = 0;
    for (ll i = 0; i < M; i++) {
        now_max_idx = max(now_max_idx, idx[i][0]);
    }
    for (ll i = 0; i < N; i++) {
        // debug_out(i, now_max_idx);
        ans[now_max_idx - i]++;
        ans[N - i]--;

        if (A[i] < M) {
            now_idx[A[i]]++;
            if (idx[A[i]].size() == now_idx[A[i]]) {
                break;
            }
            now_max_idx = max(now_max_idx, idx[A[i]][now_idx[A[i]]]);
        }
    }
    for (ll i = 0; i < N; i++) {
        ans[i + 1] += ans[i];
    }
    for (ll i = 0; i < N; i++) {
        cout << ans[i] << endl;
    }
}