#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000003, maxn = 1e9 + 1;
int h, z, n, ggg, pos[2], ans[10], x[100005], y[100005], head[2][1000003];
struct node
{
  int v, w, next;
} e[2][1000003];
int get(int key)
{
  return key % MOD;
}
void insert(bool f, int key, int w)
{
  int idx = get(key);
  e[f][++pos[f]] = {key, w, head[f][idx]};
  head[f][idx] = pos[f];
}
int find(bool f, int key)
{
  int idx = get(key);
  for (int i = head[f][idx]; i; i = e[f][i].next)
    if (e[f][i].v == key)
      return e[f][i].w;
  return 0;
}
int get(int x1, int y1)
{
  int sum = 0;
  for (int j = 0; j < 3; j++)
    for (int k = 0; k < 3; k++)
      sum += find(0, (x1 + j) * maxn + y1 + k);
  return sum;
}
signed main()
{
#ifndef ONLINE_JUDGE
  freopen("data/data.in", "r", stdin);
// freopen("data/data.out", "w", stdout);
#endif
  srand(time(0ll));
  std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  h = 10000, z = 10000, n = 100000;
  for (int i = 1; i <= n; i++)
    x[i] = rand() % 10000 + 1, y[i] = rand() % 10000 + 1, insert(0, x[i] * maxn + y[i], 1);
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < 3; j++)
      for (int k = 0; k < 3; k++)
        if (x[i] - j >= 1 && y[i] - k >= 1 && x[i] - j + 2 <= h && y[i] - k + 2 <= z && !find(1, (x[i] - j) * maxn + y[i] - k))
          insert(1, (x[i] - j) * maxn + y[i] - k, 1), ans[get(x[i] - j, y[i] - k)]++;
  for (int i = 1; i <= 9; i++)
    ggg += ans[i];
  cout << (h - 2) * (z - 2) - ggg << '\n';
  for (int i = 1; i <= 9; i++)
    cout << ans[i] << '\n';
  exit(0);
}