#include using namespace std; //#include //using namespace atcoder; //using mint = modint998244353; //多倍長整数// //#include //namespace mp = boost::multiprecision; //using Bint = mp::cpp_int; const int INF = 1e9; const int MOD = 998244353; const long long LINF = 4e18; using ll = long long; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using vb = vector; using vvi = vector>; using vvvi = vector>>; using vvvvi = vector>>>; using vvl = vector>; using vvvl = vector>>; using vvvvl = vector>>>; using vvc = vector>; using vvb = vector>; using vvvb = vector>>; using vvvvb = vector>>>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define dump(x) cout << #x << " = " << (x) << endl; #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define ALL(obj) (obj).begin(),(obj).end() int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n,m; cin >> n >> m; vvi g1(n*(m + 1)); vvi g2(n*(m + 1)); rep(i,m + 1){ rep(j,n - 1){ g2[n*i + j].push_back(n*i + j + 1); g2[n*i + j + 1].push_back(n*i + j); } } rep(i,m){ int a; cin >> a; a--; g1[n*(i + 1) + a].push_back(n*i + a + 1); g1[n*(i + 1) + a + 1].push_back(n*i + a); rep(j,n){ if(j == a || j == a + 1) continue; g1[n*(i + 1) + j].push_back(n*i + j); } } deque que; que.push_back(n*m); vector dist(n*(m + 1),INF); dist[n*m] = 0; while(!que.empty()){ int cur = que.front(); que.pop_front(); for(int next : g1[cur]){ if(dist[next] > dist[cur]){ dist[next] = dist[cur]; que.push_front(next); } } for(int next : g2[cur]){ if(dist[next] > dist[cur] + 1){ dist[next] = dist[cur] + 1; que.push_back(next); } } } for(int i = 1;i < n;i++){ cout << dist[i] << ' '; } return 0; }