#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define ph push
#define f first
#define s second
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define btinpct(x) __builtin_popcountll((x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss
string to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?b:gcd(b%a,a); }
#define ll long long int
#define ld long double
#define FOR(ii, ss, ee) for(ll ii = (ss); ii <= (ll)(ee); ++ii)
#define DEC(ii, ss, ee) for(ll ii = (ss); ii >= (ll)(ee); --ii)
typedef pair <ll, ll> pi; typedef pair <ll, pi> spi; typedef pair <pi, pi> dpi;
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
// #define cerr if(0)cout
#define MAXN (1000006)
ll n, m, A[MAXN]; ll N;
vector<pi> v;
ll ans[MAXN];
vector<ll> cnt;
struct node {
int s,e,m;
ll v;
node *l,*r;
node (ll _S, ll _E) {
s=_S,e=_E,m=(s+e)>>1;
v=0;
if(s^e){
l=new node(s,m);
r=new node(m+1,e);
}
}
void update(ll x,ll nval) {
if(s==e) {
v+=nval;
return;
}
if(x>m) r->update(x,nval); else l->update(x,nval);
v=max(l->v,r->v);
}
ll rmq() {
return v;
}
} *seg;
void solve() {
ll n=v.size();
vector<ll> mp(m+1, 0);
vector<vector<ll>> adj(m+1, vector<ll>());
FOR(i,0,n-1) if(v[i].s!=-1) {
adj[v[i].f].eb(v[i].s);
adj[v[i].s].eb(v[i].f);
}
FOR(i,1,m) {
// ll n=v.size();
ll add = 0;
for(auto j:adj[i]) seg->update(j, -1);
seg->update(i, -cnt[i]);
add = N-cnt[i]-seg->rmq();
ans[i]=min(ans[i], add);
seg->update(i,cnt[i]);
for(auto j:adj[i]) seg->update(j, 1);
}
}
int main()
{
FAST
cin>>n>>m;N=n;
if(m==1) {
cout<<0; return 0;
}
FOR(i,1,n) cin>>A[i]; cnt.resize(m+1, 0); for(ll i=1;i<=n;++i) cnt[A[i]] ++; seg=new node(1, m); FOR(i,1,n) seg->update(A[i],1);
for(ll i=1;i<=n;i+=2) v.eb(A[i], (i+1>n?-1:A[i+1]));
fill(ans, ans+MAXN, LLINF);
solve();
v.clear();
v.eb(A[1], -1);
for(ll i=2;i<=n;i+=2) v.eb(A[i], (i+1>n?-1:A[i+1]));
solve();
for(ll i=1;i<=m;++i) cout<<ans[i]<<'\n';
}
