/**
 * author:	t9unkubj
 * created:	2024-03-15 
 */

#include<bits/stdc++.h>

#ifdef t9unkubj
#define _GLIBCXX_DEBUG
#define dbg(x) cout<<__LINE__<<" "<<#x<<":="<<x<<endl;
#else 
#define dbg(x) 58
#endif

using namespace std;

//#include<atcoder/all>
//using namespace atcoder;
int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n,m;
	cin>>n>>m; 
	vector<int>a(m);
	for(int i=0;i<m;i++)cin>>a[i],a[i]--;
	vector<vector<pair<int,int>>>g(n*(m+1));
	for(int i=0;i<m;i++){
		for(int j=0;j<n;j++){
			if(j==a[i])g[i*n+n+j+1].push_back({i*n+j,0});
			else if(j==a[i]+1)g[i*n+n+j-1].push_back({i*n+j,0});
			else g[i*n+n+j].push_back({i*n+j,0});
		}
	}
	using T=pair<int,int>;
	priority_queue<T,vector<T>,greater<T>>que;
	vector<int>md(n*(m+1),1<<30);
	md[n*m]=0;
	que.push({0,n*m});
	while(que.size()){
		auto [p,q]=que.top();que.pop();
		if(p!=md[q])continue;
		for(auto [x,w]:g[q]){
			if(md[x]>p+w)md[x]=p+w,que.push({md[x],x});
		}
		for(int i=q/n*n;i<q/n*(n)+n;i++){
			dbg(i);
			if(md[i]>p+abs((i)-q))md[i]=p+abs((i)-q),que.push({md[i],i});
		}
	}
	for(int i=1;i<n;i++)cout<<md[i]<<" ";
	cout<<endl;
}