//M未満のとき進み続ける
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i < (long long)(n); i++)
typedef long long ll;
#define updiv(N,X) (N + X - 1) / X
#define l(n) n.begin(),n.end()
#define YesNo(Q) Q==1?cout<<"Yes":cout<<"No"
using P = pair<int, int>;
using mint = modint;
const int MOD = 998244353LL;
const ll INF = 999999999999LL;
vector<long long> fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
template <typename T>
void input(vector<T> &v){
 rep(i,v.size()){cin>>v[i];}
  return;
}
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

ll POW(ll a,ll n){
  long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a;
        a = a * a;
        n >>= 1;
    }
    return res;
}
pair<vector<pair<long long, long long> >,bool> pf(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= min(N,300000LL*300000LL); ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        // その結果を push
        res.push_back({a, ex});
    }
     
    // 最後に残った数について
    if (N != 1) res.push_back({N, 1});
    bool dff = (bool)(N==1);
    return pair(res,dff);
}
int main() {
int n,m;cin>>n>>m;
vector<ll> v(n+1,-1);
rep(i,n){cin>>v[i];}
map<ll,ll> mp;
rep(i,m+10){mp[i]=0;}
ll cnt = m;//条件に反するやつーの数ー
vector<ll> cum(n+2,0);
deque<ll> dq;
//front <-> back
ll idx = 0;
rep(i,n){
while(true){
if(0==cnt||(!dq.empty()&&dq.back()==-1)){break;}
dq.push_back(v[idx]);	

mp[v[idx]]++;
if(1==mp[v[idx]]&&m>v[idx]){cnt--;}
idx++;
}
//cout << dq.size() << " ";
cum[dq.size()]++;
if(!dq.empty()){
	//cout << dq.front()<<" ";
	mp[dq.front()]--;
	if(0==mp[dq.front()]&&m>dq.front()){cnt++;}
	dq.pop_front();}//cout<<endl;
}

for(int i = n;0<=i;i--){
	cum[i] += cum[i+1];
}

rep(i,n){
	cout << n-i-cum[i+2] << endl; 
}
}