#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef pair<int, int> P;
int h, w;
int n;
int a, b;
long long ans[11];
map<P, int>mp;
int main() {
	cin >> h >> w >> n;
	rep(i, n) {
		cin >> a >> b;
		for (int j = max(2, a - 1);j <= min(h - 1, a + 1);j++) {
			for (int k = max(2, b - 1);k <= min(w - 1, b + 1);k++) {
				mp[{j, k}]++;
			}
		}
	}
	for (auto x : mp) {
		ans[x.second]++;
	}
	ans[0] = (long long)(h-2) * (w-2) - mp.size();
	rep(i, 10)cout << ans[i] << endl;
	getchar();getchar();
	return 0;
}