#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<vector>
using namespace std;
#define re int
inline int read(){
	int x=0,ff=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')ff=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^'0');c=getchar();}
	return x*ff;
}
#define lz (i<<1)
#define rz (i<<1|1)
#define mid ((l+r)>>1)
int n,m,f[1600005],lt[1600005],rt[16000005],ls[16000005],rs[16000005];
vector<int>qwq[200005];
bool tuu[1600005];
inline void push_up(int i){
	lt[i]=lt[lz];rt[i]=rt[rz];
	ls[i]=ls[lz];rs[i]=rs[rz];
	f[i]=f[lz]+f[rz]+((lt[rz]!=rt[lz])?((ls[rz]+rs[lz])/2-ls[rz]/2-rs[lz]/2):0);
	tuu[i]=(tuu[lz]&tuu[rz])&(lt[rz]!=rt[lz]);
	if(lt[rz]!=rt[lz]){
		if(tuu[lz])ls[i]=ls[i]+ls[rz];
		if(tuu[rz])rs[i]=rs[i]+rs[lz];
	}
}
void build(int i,int l,int r){
	if(l==r){tuu[i]=1;
		f[i]=0;ls[i]=rs[i]=1;return;
	}
	build(lz,l,mid);build(rz,mid+1,r);
	push_up(i);
}
void update(int i,int l,int r,int x){
	if(l==r){
		f[i]=0;lt[i]=rt[i]=1;ls[i]=rs[i]=1;return;
	}
	if(mid>=x)update(lz,l,mid,x);
	else update(rz,mid+1,r,x);
	push_up(i);
}
int ss,la,kk;
void query(int i,int l,int r,int x,int y){
	if(x<=l&&r<=y){
		ss+=f[i];
		//cout<<l<<" "<<r<<" "<<x<<" "<<y<<" "<<f[i]<<" "<<ss<<" "<<kk<<" "<<ls[i]<<" "<<rs[i]<<" "<<lt[i]<<" "<<la<<endl;
		if(la!=-1){
			ss+=((la!=lt[i])?(ls[i]+kk)/2-ls[i]/2-kk/2:0);
		}
		if(!tuu[i]||lt[i]==la)kk=rs[i];
		else kk+=rs[i];
		//cout<<kk<<" "<<rs[i]<<" "<<lt[i]<<" "<<la<<endl;
		la=rt[i];return;
	}
	if(mid>=x)query(lz,l,mid,x,y);
	if(mid<y)query(rz,mid+1,r,x,y);
}
int main(){
	n=read();m=read();int x;int N=n<<1;
	for(re i=1;i<=n;i++){
		x=read();qwq[x].emplace_back(i);
	}
	build(1,1,N);
	for(re i=1;i<=m;i++){
		int u=qwq[i].size(),ans=0;
		if(!u){
			printf("-1 ");continue;
		}
		for(re j=0;j<u-1;j++){
			la=-1;ss=0;kk=0;
			if(qwq[i][j]+1<qwq[i][j+1]){
				query(1,1,N,qwq[i][j]+1,qwq[i][j+1]-1);
			}
			//cout<<i<<" "<<j<<" "<<qwq[i][j]+1<<" "<<qwq[i][j+1]-1<<" "<<ss<<endl;
			ans+=ss;
		}
		ss=0;la=-1;kk=0;
		if(qwq[i][0]+n-1>=qwq[i][u-1]+1){
			query(1,1,N,qwq[i][u-1]+1,qwq[i][0]+n-1);
		}
		ans+=ss;
		printf("%d ",ans+n-u);
		//cout<<i<<" "<<ans<<endl;
		for(re j:qwq[i]){
			update(1,1,N,j);update(1,1,N,j+n);
		}
	}puts("");
	return 0;
}