#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 p[500] = {};
  
  res = scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    p[i] = i;
    for (int j = 0; j < i; j++) {
      d[j][i] = i-j;
      d[i][j] = i-j;
    }
  }
  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) {
      for (int j = 0; j < n; j++) {
        if (d[j][p[a-2]] > d[j][p[a-1]]+1) {
          d[j][p[a-2]] = d[j][p[a-1]]+1;
        }
      }
      for (int j = 0; j < n; j++) {
        if (d[j][p[a-1]] > d[j][p[a-2]]+1) {
          d[j][p[a-1]] = d[j][p[a-2]]+1;
        }
      }
    }
    if (a < n-1) {
      for (int j = 0; j < n; j++) {
        if (d[j][p[a+1]] > d[j][p[a]]+1) {
          d[j][p[a+1]] = d[j][p[a]]+1;
        }
      }
      for (int j = 0; j < n; j++) {
        if (d[j][p[a]] > d[j][p[a+1]]+1) {
          d[j][p[a]] = d[j][p[a+1]]+1;
        }
      }
    }
  }
  
  for (int i = 0; i < n-1; i++) {
    ans[i] = d[i+1][p[0]];
  }
  
  printf("%d", ans[0]);
  for (int i = 1; i < n-1; i++) {
    printf(" %d", ans[i]);
  }
  printf("\n");
  
  return 0;
}