#include <iostream>
#include <set>

using namespace std;

int main() {
	long long h, w, n;
	long long ans[10] = {};

	cin >> h >> w >> n;
	ans[0] = (h - 2) * (w - 2);

	set<pair<int, int>> s;
	while (n--) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		s.insert(make_pair(a, b));

		for (int i = -1; i <= 1; i++)
			for (int j = -1; j <= 1; j++)
				if (a + i - 1 >= 0 && a + i + 1 < h && b + j - 1 >= 0 && b + j + 1 < w) {
					int cnt = 0;
					for (int k = -1; k <= 1; k++)
						for (int l = -1; l <= 1; l++)
							cnt += s.find(make_pair(a + i + k, b + j + l)) != s.end();
					ans[cnt - 1]--;
					ans[cnt]++;
				}
	}

	for (int i = 0; i < 10; i++)
		cout << ans[i] << endl;

	return 0;
}
