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

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

using std::cin;
using std::cout;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

// ref: https://drken1215.hatenablog.com/entry/2023/11/26/233800
// removable min heap
template<class T> struct removable_min_heap {
    // inner data
    priority_queue<T, vector<T>, greater<T>> que, delay;
    
    // constructor
    removable_min_heap() {}

    // push(x), remove(x)
    void push(T x) { que.push(x); }
    void remove(T x) { delay.push(x); }
    int size() { return (int)que.size() - (int)delay.size(); }
    
    // pop min value
    T pop() {
        T res = top();
        que.pop();
        return res;
    }
    
    // get min value (not pop)
    T top() {
        assert(!que.empty());
        while (!delay.empty() && que.top() == delay.top()) {
            que.pop();
            delay.pop();
        }
        assert(!que.empty());
        return que.top();
    }
};

struct mex_multiset {
    map<int, int> mp;
    removable_min_heap<int> que;

    mex_multiset(int max_mex) {
        rep(i, max_mex+1) que.push(i);
    }

    void erase_one(int x) {
        --mp[x];
        if(mp[x] == 0) que.push(x);
    }

    void insert(int x) {
        if(mp[x] == 0) que.remove(x);
        ++mp[x];
    }

    int get_mex() {
        return que.top();
    }
};

int find_mex(vector<int> x) {
    mex_multiset mex(x.size());
    return mex.get_mex();
}

void solve() {
    int n, m;
    cin >> n >> m;
    vi a(n);
    FOR(n) cin >> a[i];

    if(m == 0) {
        FOR(n) cout << n-i << endl;
        return;
    }

    int r = 0;
    mex_multiset mex(3e5);

    vi cum(n+1, 0);
    
    rep(l, n) {
        while(mex.get_mex() < m && r < n) {
            mex.insert(a[r]);
            r++;
        }
        if(mex.get_mex() >= m) {
            cum[r-l]++;
            if(n-l+1 <= n) cum[n-l+1]--;
        }
        mex.erase_one(a[l]);
    }
    // repi(i, 1, n+1) cout << cum[i] << " \n"[i == n];
    FOR(n) cum[i+1] += cum[i];

    repi(i, 1, n+1) cout << cum[i] << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}