#pragma GCC target("avx2") #pragma GCC optimize("Ofast,unroll-loops") #include #define rep(i, n) for (int i = 0; i < n; i++) #define per(i, n) for (int i = n - 1; i >= 0; i--) #define ALL(a) a.begin(), a.end() using namespace std; #if __has_include() #include using mint = atcoder::modint998244353; istream &operator>>(istream &is, mint &a) { int t; is >> t; a = t; return is; } ostream &operator<<(ostream &os, mint a) { return os << a.val(); } #endif typedef long double ldouble; #undef long #define long long long #define vec vector template ostream &operator<<(ostream &os, vector &a) { const int n = a.size(); rep(i, n) { os << a[i]; if (i + 1 != n) os << " "; } return os; } template ostream &operator<<(ostream &os, array &a) { rep(i, n) os << a[i] << " \n"[i + 1 == n]; return os; } template istream &operator>>(istream &is, vector &a) { for (T &i : a) is >> i; return is; } template bool chmin(T &x, S y) { if (x > (T)y) { x = (T)y; return true; } return false; } template bool chmax(T &x, S y) { if (x < (T)y) { x = (T)y; return true; } return false; } template void operator++(vector &a) { for (T &i : a) ++i; } template void operator--(vector &a) { for (T &i : a) --i; } template void operator++(vector &a, int) { for (T &i : a) i++; } template void operator--(vector &a, int) { for (T &i : a) i--; } #undef endl #define endl '\n' void solve() { int n, m; cin >> n >> m; vec a(m); cin >> a; a--; constexpr int inf = 1e9; for(int idx = 1 ; idx < n ; idx++) { vec dp(n); rep(i, n) dp[i] = abs(i - idx); for (int i : a) { swap(dp[i], dp[i + 1]); rep(j, n) chmin(dp[j], dp[i] + abs(j - i)); rep(j, n) chmin(dp[j], dp[i + 1] + abs(j - i - 1)); } cout << dp[0] << ' '; } } int main() { // srand((unsigned)time(NULL)); cin.tie(nullptr); ios::sync_with_stdio(false); // cout << fixed << setprecision(40); int t = 1; // cin >> t; while (t--) solve(); return 0; }