#include <iostream>
#include <vector>

using namespace std;

constexpr int iINF = 1'000'000'000;

int main () {
    int N, M; cin >> N >> M;
    vector<int> A(M);
    vector<int> ans;

    for (int i = 0; i < M; i++) cin >> A[i];

    for (int bob_first = 2; bob_first <= N; bob_first++) {
        vector<vector<int>> dp(M + 1, vector<int>(N + 1, iINF));
        // dp[i][j] := 操作i回終了後、bobのプレゼントが場所jにいるための最小ズル回数

        for (int i = 0; bob_first + i <= N; i++) dp[0][bob_first + i] = i;
        for (int i = 0; 1 <= bob_first - i; i++) dp[0][bob_first - i] = i;

        for (int i = 0; i < M; i++) {
            for (int j = 1; j <= N; j++) dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);

            // 操作
            dp[i + 1][A[i] + 1] = dp[i][A[i]];
            dp[i + 1][A[i]] = dp[i][A[i] + 1];

            int zero = 0;
            for (int j = 1; j <= N; j++) if (dp[i + 1][j] == 0) zero = j;

            // ズル
            for (int j = 0; zero + j <= N; j++) dp[i + 1][zero + j] = min(dp[i + 1][zero + j], j);
            for (int j = 0; 1 <= zero - j; j++) dp[i + 1][zero - j] = min(dp[i + 1][zero - j], j);

            /*
            for (int j = 1; j <= N; j++) cout << dp[i + 1][j] << " ";
            cout << "\n";
            */
        }
        //cout << "\n";

        ans.push_back(dp[M][1]);
    }

    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i] << (i == ans.size() - 1 ? '\n' : ' ');
    }
}