#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const int N=1<<20;
int n,m,A[N],cnt[N],ans[N];
bitset<N>is;
vector<int>vec[N];
int seg[N*2];
void upd(int i,int x,int l=1,int r=n+1,int v=1){
if(r-l==1){
seg[v]+=x;
return;
}
int mid=(l+r)>>1;
if(i<mid)upd(i,x,l,mid,v<<1);
else upd(i,x,mid,r,v<<1|1);
seg[v]=max(seg[v<<1],seg[v<<1|1]);
}
void er(int i,int oo,int c){
i=(i+oo)/2;
if(is[i]!=c)return;
is[i]=1-is[i];
int i1=-oo+i*2,i2=-oo+i*2+1;
if(1<=i1 && i1<=n)
upd(A[i1],(c==1 ? 1:-1));
if(1<=i2 && i2<=n)
upd(A[i2],(c==1 ? 1:-1));
}
int main(){
fast_io
cin>>n>>m;
for1(n)cin>>A[i];
for1(n)vec[A[i]].pb(i);
for1(n)upd(A[i],1);
for(int c=1;c<=m;c++){
for(int i:vec[c])
er(i,0,0);
ans[c]=max(ans[c],int(seg[1]+1*vec[c].size()));
for(int i:vec[c])
er(i,0,1);
}
for(int c=1;c<=m;c++){
for(int i:vec[c])
er(i,1,0);
ans[c]=max(ans[c],int(seg[1]+vec[c].size()));
for(int i:vec[c])
er(i,1,1);
}
for1(m)cout<<n-ans[i]<<endl;
}
