#include <bits/stdc++.h>
#define int long long
using namespace std;
int h, z, n, ggg, ans[10], x[100005], y[100005];
unordered_map<int, unordered_map<int, int>> a, vis;
int get(int x1, int y1)
{
  int sum = 0;
  for (int j = 0; j < 5; j++)
    for (int k = 0; k < 5; k++)
      sum += a[x1 + j][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, a[x[i]][y[i]]++;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < 1; j++)
      for (int k = 0; k < 1; k++)
        if (x[i] - j >= 1 && y[i] - k >= 1 && x[i] - j + 2 <= h && y[i] - k + 2 <= z && !vis[x[i] - j][y[i] - k])
          vis[x[i] - j][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);
}