#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    int N, M; cin >> N >> M;
    vector<int> A(M); rep(i,M){ cin >> A[i]; A[i]--; }
    reverse(A.begin(), A.end());
    vector<int> Q(N, 1001001001);
    rep(i,N) Q[i] = i;
    for(int a : A){
        swap(Q[a], Q[a+1]);
        rep(i,N-1) chmin(Q[i+1], Q[i] + 1);
        repr(i,N-1) chmin(Q[i], Q[i+1] + 1);
    }
    rep(i,N-1){
        if(i) cout << ' ';
        cout << Q[i+1];
    } cout << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}