// #pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
// #include <x86intrin.h>
using namespace std;
#if __cplusplus >= 202002L
using namespace numbers;
#endif
template<class T> T &ctmin(T &x){ return x; }
template<class T, class Head, class ...Tail> T &ctmin(T &x, const Head &h, const Tail &... t){ return ctmin(x = min<T>(x, h), t...); }
template<class T> T &ctmax(T &x){ return x; }
template<class T, class Head, class ...Tail> T &ctmax(T &x, const Head &h, const Tail &... t){ return ctmax(x = max<T>(x, h), t...); }



int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	int n, m;
	cin >> n >> m;
	vector<vector<int>> gift(m + 1, vector<int>(n));
	vector<vector<int>> pos(m + 1, vector<int>(n));
	iota(gift[0].begin(), gift[0].end(), 0);
	iota(pos[0].begin(), pos[0].end(), 0);
	for(auto i = 0; i < m; ++ i){
		gift[i + 1] = gift[i];
		int x;
		cin >> x, -- x;
		swap(gift[i + 1][x], gift[i + 1][x + 1]);
		for(auto j = 0; j < n; ++ j){
			pos[i + 1][gift[i + 1][j]] = j;
		}
	}
	int obj = gift[m][0];
	for(auto x = 1; x < n; ++ x){
		int res = numeric_limits<int>::max();
		vector<int> dp(n);
		for(auto c = 0; c < n; ++ c){
			dp[c] = abs(pos[0][x] - pos[0][c]);
		}
		for(auto step = 1; step <= m; ++ step){
			static vector<int> dp_next(n);
			for(auto c = 0; c < n; ++ c){
				dp_next[c] = dp[c];
			}
			for(auto i = 1; i < n; ++ i){
				ctmin(dp_next[gift[step][i]], dp_next[gift[step][i - 1]] + 1);
			}
			for(auto i = n - 2; i >= 0; -- i){
				ctmin(dp_next[gift[step][i]], dp_next[gift[step][i + 1]] + 1);
			}
			swap(dp, dp_next);
		}
		cout << dp[obj] << " ";
	}
	cout << "\n";
	return 0;
}

/*

*/