#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(m);
	rep(i, m)cin >> a[i], a[i]--;
	vector b(m + 1, vector<int>(n));
	rep(i, n)b[0][i] = i;
	rep(i, m) {
		rep(j, n) {
			b[i + 1][j] = b[i][j];
		}
		swap(b[i + 1][a[i]], b[i + 1][a[i] + 1]);
	}
	vector<int> dp(n);
	rep(i, n)dp[b[m][i]] = i;
	rrep(i, m) {
		vector<int>v(n);
		rep(j, n)v[j] = dp[b[i][j]];
		int tmp = INF;
		rep(j, n) {
			chmin(dp[b[i][j]], tmp);
			chmin(tmp, v[j]);
			tmp++;
		}
	}
	rep2(i, 1, n) {
		if (1 != i)cout << " ";
		cout << dp[i];
	}
	cout << endl;
	return 0;
}