#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

#if __cplusplus >= 202002L

#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

#else

#define ssize(v) (int)(v).size()
#define popcount(x) __builtin_popcountll(x)
constexpr int bit_width(const unsigned int x) { return x == 0 ? 0 : ((sizeof(unsigned int) * CHAR_BIT) - __builtin_clz(x)); }
constexpr int bit_width(const unsigned long long x) { return x == 0 ? 0 : ((sizeof(unsigned long long) * CHAR_BIT) - __builtin_clzll(x)); }
constexpr int countr_zero(const unsigned int x) { return x == 0 ? sizeof(unsigned int) * CHAR_BIT : __builtin_ctz(x); }
constexpr int countr_zero(const unsigned long long x) { return x == 0 ? sizeof(unsigned long long) * CHAR_BIT : __builtin_ctzll(x); }
constexpr unsigned int bit_ceil(const unsigned int x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1u << bit_width(x))); }
constexpr unsigned long long bit_ceil(const unsigned long long x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1ull << bit_width(x))); }

#endif

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << x << '\n'
#else
#define dbg(x)
#endif

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(const T &x : s)
    os << x << ' ';
  return os;
}


signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, m; cin >> n >> m;
  vector<int> a(m);
  for(int &x : a) {
    cin >> x;
    x--;
  }
  a.emplace_back(-2);

  for(int k = 1; k < n; k++) {
    vector<int> dp(n, INT_MAX);
    dp[k] = 0;
    for(int x : a) {
      priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> pq;
      for(int i = 0; i < n; i++)
        pq.push({dp[i], i});
      while(!pq.empty()) {
        auto [v, i] = pq.top(); pq.pop();
        if (v != dp[i] or v == INT_MAX) continue;
        if (i > 0 and dp[i] + 1 < dp[i - 1]) {
          dp[i - 1] = dp[i] + 1;
          pq.push({dp[i - 1], i - 1});
        }
        if (i + 1 < n and dp[i] + 1 < dp[i + 1]) {
          dp[i + 1] = dp[i] + 1;
          pq.push({dp[i + 1], i + 1});
        }
      }
      vector<int> nxt(n, INT_MAX);
      for(int i = 0; i < n; i++) {
        if (x == i - 1) nxt[i - 1] = min(dp[i], nxt[i - 1]);
        else if (x == i) nxt[i + 1] = min(dp[i], nxt[i + 1]);
        else nxt[i] = min(nxt[i], dp[i]);
      }
      dp.swap(nxt);
    }
    cout << dp[0] << " \n"[k + 1 == n];
  }

  return 0;
}