#include <bits/stdc++.h>
using namespace std;
const long long INFL = 1LL << 60;
const int INF = 1 << 30;
long long MOD = 1000000007;
vector<long long> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<long long> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};
void BinarySay(long long x, long long y = 60) {
  for (long long i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1);
  cout << endl;
}
long long pow_long(long long x, long long k) {
  long long res = 1;
  while (k > 0) {
    if (k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
long long pow_mod(long long x, long long k) {
  long long res = 1;
  while (k > 0) {
    if (k % 2) {
      res *= x;
      res %= MOD;
    }
    x *= x;
    x %= MOD;
    k /= 2;
  }
  return res;
}
long long inverse(long long x) { return pow_mod(x, MOD - 2); };
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; };
long long kai_mod(long long x) {
  if (x == 0) return 1;
  return x * kai_mod(x - 1) % MOD;
}
const int MAXcomb = 200010;
long long fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAXcomb; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long comb(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
long long N, M;
vector<long long> x;
void solve() {
  long long cnt = 0;
  for (long long i = 0; i < (M - 1); i++) {
    cnt += abs(x[i] - x[i + 1]);
  }
  vector<pair<long long, long long>> edgemM, edgeMm, inc(N);
  for (long long i = 0; i < (M - 1); i++) {
    inc[x[i]].second++;
    inc[x[i + 1]].second++;
    if (x[i] < x[i + 1]) {
      inc[x[i]].first += x[i];
      inc[x[i + 1]].first += 2 * x[i] - x[i + 1] + 1;
    } else {
      inc[x[i]].first += 2 * x[i + 1] - x[i] + 1;
      inc[x[i + 1]].first += x[i + 1];
    }
  }
  for (long long i = 0; i < (M - 1); i++) {
    edgemM.push_back({min(x[i], x[i + 1]), max(x[i], x[i + 1])});
    edgeMm.push_back({max(x[i], x[i + 1]), min(x[i], x[i + 1])});
  }
  sort(edgeMm.begin(), edgeMm.end());
  sort(edgemM.begin(), edgemM.end());
  for (long long i = 0; i < (N); i++) {
    pair<long long, long long> p1 = {i, -1}, p2 = {i, INFL};
    long long num1 =
        lower_bound(edgeMm.begin(), edgeMm.end(), p1) - edgeMm.begin();
    long long num2 =
        lower_bound(edgemM.begin(), edgemM.end(), p2) - edgemM.begin();
    num2 = (M - 1) - num2;
    long long res = cnt + inc[i].first - (M - 1 - num1 - num2 - inc[i].second);
    cout << res;
    if (i == N - 1)
      cout << endl;
    else
      cout << " ";
  }
}
int main() {
  cin >> N >> M;
  vector<long long> y(M);
  for (long long i = 0; i < (M); i++) {
    cin >> y[i];
    y[i]--;
  }
  y.push_back(INFL);
  for (long long i = 0; i < (M); i++) {
    if (y[i] != y[i + 1]) {
      x.push_back(y[i]);
    }
  }
  M = x.size();
  solve();
}
