#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
struct Tt {
  int r, c, id;
} data[100005];
int n, m, a[100005], res[20];
bool cmpa(const Tt A, const Tt B) {
  if (A.r == B.r) {
    return A.c < B.c;
  }
  return A.r < B.r;
}
bool cmpb(const Tt A, const Tt B) {
  if (A.c == B.c) {
    return A.r < B.r;
  }
  return A.c < B.c;
}
bool cmpc(Tt A, Tt B) {
  if (A.r - A.c == B.r - B.c) {
    if (A.r == B.r) return A.c < B.c;
    return A.r < B.r;
  }
  return A.r - A.c < B.r - B.c;
}
bool cmpd(Tt A, Tt B) {
  if (A.r + A.c == B.r + B.c) {
    if (A.r == B.r) return A.c < B.c;
    return A.r < B.r;
  }
  return A.r + A.c < B.r + B.c;
}
int main() {
  scanf("%d %d", &n, &m);
  for (__typeof(m) i = (1); i <= (m); i++) {
    scanf("%d %d", &data[i].r, &data[i].c);
    data[i].id = i;
  }
  data[0].r = 100000000;
  data[0].c = 1000000000;
  sort(data + 1, data + m + 1, cmpa);
  for (int i = 1; i <= m; i++) {
    if (data[i].r == data[i - 1].r) a[data[i].id]++, a[data[i - 1].id]++;
  }
  sort(data + 1, data + m + 1, cmpb);
  for (int i = 1; i <= m; i++) {
    if (data[i].c == data[i - 1].c) a[data[i].id]++, a[data[i - 1].id]++;
  }
  sort(data + 1, data + m + 1, cmpc);
  for (int i = 1; i <= m; i++) {
    if (data[i].r - data[i].c == data[i - 1].r - data[i - 1].c)
      a[data[i].id]++, a[data[i - 1].id]++;
  }
  sort(data + 1, data + m + 1, cmpd);
  for (int i = 1; i <= m; i++) {
    if (data[i].r + data[i].c == data[i - 1].r + data[i - 1].c)
      a[data[i].id]++, a[data[i - 1].id]++;
  }
  for (__typeof(m) i = (1); i <= (m); i++) res[a[i]]++;
  for (int i = 0; i <= 8; i++) printf("%d ", res[i]);
  return 0;
}
