#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

int nextInt() {
  int x; scanf("%d", &x); return x;
}

int main() {
  ll H = nextInt(), W = nextInt();;
  int N = nextInt();

  map< P, int > mp;
  for (int i = 0; i < N; i++) {
    int a = nextInt(), b = nextInt();
    for (int dx = -1; dx <= 1; dx++) {
      for (int dy = -1; dy <= 1; dy++) {
        int na = a + dx;
        int nb = b + dy;
        if (2 <= na && na <= H-1 && 2 <= nb && nb <= W-1) 
          ++mp[ P(na, nb) ];
      }
    }
  }
  vector<ll> ans(10);
  ans[0] += (H-2) * (W-2) - mp.size();
  for (auto p = mp.begin(); p != mp.end(); ++p) {
    ++ans[p->second];
  }
  for (int i = 0; i < 10; i++) cout << ans[i] << endl;
}
