/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
          　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#pragma GCC target("arch=skylake-avx512")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse4")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for (int i = n; i < (m); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg) / 360.0L) * 2.0L * PI)
#define rad_to_deg(rad) (((rad) / 2.0L / PI) * 360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))

using ll = long long;
using ull = unsigned long long;

constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-14;
const long double PI = acosl(-1.0L);

using namespace std;

void scans(string& str) {
    char c;
    str = "";
    scanf("%c", &c);
    if (c == '\n') scanf("%c", &c);
    while (c != '\n' && c != -1 && c != ' ') {
        str += c;
        scanf("%c", &c);
    }
}

void scanc(char& str) {
    char c;
    scanf("%c", &c);
    if (c == -1) return;
    while (c == '\n') {
        scanf("%c", &c);
    }
    str = c;
}

double acot(double x) {
    return PI / 2 - atan(x);
}

ll LSB(ll n) { return (n & (-n)); }

template <typename T>
inline T chmin(T& a, const T& b) {
    if (a > b) a = b;
    return a;
}

template <typename T>
inline T chmax(T& a, const T& b) {
    if (a < b) a = b;
    return a;
}

// cpp_int
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
#else
using cpp_int = ll;
#endif

// atcoder library
#if __has_include(<atcoder/all>)
#include <atcoder/all>
// using namespace atcoder;
#endif

/*
    random_device seed_gen;
    mt19937 engine(seed_gen());
    uniform_int_distribution dist(1, 100);
*/

/*----------------------------------------------------------------------------------*/

int dp[501][500][500];
int a[500];

int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    rep(i, m) {
        scanf("%d", &a[i]);
        --a[i];
    }
    memset(dp, 0x7f, sizeof(dp));
    // time, present, index,
    rep(i, n) {
        dp[0][i][i] = 0;
    }
    rep(j, n) {
        rep(k, n) {
            for (int l = k + 1; l < n; ++l) {
                chmin(dp[0][j][k], dp[0][j][l] + abs(k - l));
                chmin(dp[0][j][l], dp[0][j][k] + abs(k - l));
            }
        }
    }
    rep(i, m) {
        rep(j, n) {
            chmin(dp[i + 1][j][a[i] + 1], dp[i][j][a[i]]);
            chmin(dp[i + 1][j][a[i]], dp[i][j][a[i] + 1]);
        }
        rep(j, n) {
            rep(k, n) {
                if (a[i] == k or a[i] + 1 == k) continue;
                chmin(dp[i + 1][j][k], dp[i][j][k]);
            }
        }
        rep(j, n) {
            rep(k, n) {
                for (int l = k + 1; l < n; ++l) {
                    chmin(dp[i + 1][j][k], dp[i + 1][j][l] + abs(k - l));
                    chmin(dp[i + 1][j][l], dp[i + 1][j][k] + abs(k - l));
                }
            }
        }
    }
    rep(i, n - 1) printf("%d ", dp[m][i + 1][0]);

    Please AC;
}