#include <stdio.h>

int main () {
  int n = 0;
  int m = 0;
  int a = 0;
  
  int res = 0;
  
  int ans[499] = {};
  
  int d[500][500] = {};
  int e[500][500] = {};
  int p[500] = {};
  
  res = scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    p[i] = i;
    e[i-1][i] = 1;
    e[i][i-1] = 1;
  }
  res = scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    int s = 0;
    res = scanf("%d", &a);
    s = p[a-1];
    p[a-1] = p[a];
    p[a] = s;
    if (a > 1) {
      e[p[a-2]][p[a-1]] = 1;
      e[p[a-1]][p[a-2]] = 1;
    }
    if (a < n-1) {
      e[p[a]][p[a+1]] = 1;
      e[p[a+1]][p[a]] = 1;
    }
  }
  
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (e[i][j] > 0) {
        d[i][j] = 1;
      } else {
        d[i][j] = n;
      }
    }
    d[i][i] = 0;
  }
  
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
        if (d[j][i]+d[i][k] < d[j][k]) {
          d[j][k] = d[j][i]+d[i][k];
        }
      }
    }
  }
  
  for (int i = 0; i < n-1; i++) {
    ans[i] = d[p[0]][i+1];
  }
  
  printf("%d", ans[0]);
  for (int i = 1; i < n-1; i++) {
    printf(" %d", ans[i]);
  }
  printf("\n");
  
  return 0;
}