#include <bits/stdc++.h>




namespace zawa {

using i16 = std::int16_t;
using i32 = std::int32_t;
using i64 = std::int64_t;
using i128 = __int128_t;

using u8 = std::uint8_t;
using u16 = std::uint16_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;

using usize = std::size_t;

} // namespace zawa


namespace zawa {

void SetFastIO() {
    std::cin.tie(nullptr)->sync_with_stdio(false);
}

void SetPrecision(u32 dig) {
    std::cout << std::fixed << std::setprecision(dig);
}

} // namespace zawa
using namespace zawa;

int main() {
    SetFastIO();

    int n, m; std::cin >> n >> m;

    const int INF{(int)1e9};
    std::vector dp(n, std::vector<int>(n, INF));
    for (int i{} ; i < n ; i++) {
        dp[i][i] = 0;
    }
    for (int i{} ; i < m ; i++) {
        int a; std::cin >> a;
        a--;
        std::vector next(n, std::vector<int>(n, INF));
        for (int j{} ; j < n ; j++) {
            {
                int min{INF};
                for (int k{} ; k < n ; k++) {
                    min = std::min(min, dp[j][k]);
                    next[j][k] = std::min(next[j][k], min);
                    min++;
                }
            }
            {
                int min{INF};
                for (int k{n - 1} ; k >= 0 ; k--) {
                    min = std::min(min, dp[j][k]);
                    next[j][k] = std::min(next[j][k], min);
                    min++;
                }
            }
        }
        for (int j{} ; j < n ; j++) std::swap(next[j][a], next[j][a + 1]);
        dp = std::move(next);
    }
    { // 末尾
    std::vector next(n, std::vector<int>(n, INF));
    for (int j{} ; j < n ; j++) {
        {
            int min{INF};
            for (int k{} ; k < n ; k++) {
                min = std::min(min, dp[j][k]);
                next[j][k] = std::min(next[j][k], min);
                min++;
            }
        }
        {
            int min{INF};
            for (int k{n - 1} ; k >= 0 ; k--) {
                min = std::min(min, dp[j][k]);
                next[j][k] = std::min(next[j][k], min);
                min++;
            }
        }
    }
    dp = std::move(next);
    }
    for (int i{1} ; i < n ; i++) {
        std::cout << dp[i][0] << (i + 1 == n ? '\n' : ' ');
    }
}