#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
#pragma GCC optimize("Ofast")
int C[1000000];
int ans[1000000],occ[1000000];
vi adj[1000000];
int tree[1 << 21];
int build(int s,int e,int i) {
if (s == e) {
tree[i] = occ[s];
return 0;
}
int mid = (s+e) / 2;
build(s,mid,2*i+1),build(mid+1,e,2*i+2);
tree[i] = max(tree[2*i+1],tree[2*i+2]);
return 0;
}
int update(int s,int e,int ai,int i,int num) {
if ((s > ai) || (e < ai)) return 0;
else if (s == e) {
tree[i] += num;
return 0;
}
int mid = (s+e) / 2;
update(s,mid,ai,2*i+1,num),update(mid+1,e,ai,2*i+2,num);
tree[i] = max(tree[2*i+1],tree[2*i+2]);
return 0;
}
int main() {
int i;
int N,M;
scanf("%d %d",&N,&M);
for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;
if (M == 1) {
printf("0\n");
return 0;
}
int j,t;
for (i = 0; i < M; i++) ans[i] = N;
for (i = 0; i < N; i++) occ[C[i]]++;
build(0,M-1,0);
for (t = 0; t < 2; t++) {
for (i = t; i+1 < N; i += 2) {
adj[C[i]].pb(C[i+1]);
adj[C[i+1]].pb(C[i]);
}
for (i = 0; i < M; i++) {
for (j = 0; j < adj[i].size(); j++) update(0,M-1,adj[i][j],0,-1);
update(0,M-1,i,0,-1e9);
ans[i] = min(ans[i],N-occ[i]-tree[0]);
for (j = 0; j < adj[i].size(); j++) update(0,M-1,adj[i][j],0,1);
update(0,M-1,i,0,1e9);
adj[i].clear();
}
}
for (i = 0; i < M; i++) printf("%d\n",ans[i]);
return 0;
}
