Problem:
Score : 400 points

Problem Statement

We have a grid with H rows and W columns. At first, all cells were painted white.

Snuke painted N of these cells. The i-th ( 1 \leq i \leq N ) cell he painted is the cell at the a_i-th row and b_i-th column.

Compute the following:

For each integer j ( 0 \leq j \leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?

Constraints

3 \leq H \leq 10^9

3 \leq W \leq 10^9

0 \leq N \leq min(10^5,H×W)

1 \leq a_i \leq H (1 \leq i \leq N)

1 \leq b_i \leq W (1 \leq i \leq N)

(a_i, b_i) \neq (a_j, b_j) (i \neq j)

Input

The input is given from Standard Input in the following format:

H W N
a_1 b_1
:
a_N b_N

Output

Print 10 lines.
The (j+1)-th ( 0 \leq j \leq 9 ) line should contain the number of the subrectangles of size 3×3 of the grid that contains exactly j black cells.

Sample Input 1

4 5 8
1 1
1 4
1 5
2 3
3 1
3 2
3 4
4 4

Sample Output 1

0
0
0
2
4
0
0
0
0
0

There are six subrectangles of size 3×3. Two of them contain three black cells each, and the remaining four contain four black cells each.

Sample Input 2

10 10 20
1 1
1 4
1 9
2 5
3 10
4 2
4 7
5 9
6 4
6 6
6 7
7 1
7 3
7 7
8 1
8 5
8 10
9 2
10 4
10 9

Sample Output 2

4
26
22
10
2
0
0
0
0
0

Sample Input 3

1000000000 1000000000 0

Sample Output 3

999999996000000004
0
0
0
0
0
0
0
0
0

Solution in C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

#define EMPTY 0
#define FULL 1
#define DELETED 2
 
#define INF 1000000000
 
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

typedef struct {
	long key;
	int flag;
} Data;

long H, W, N;
long a[100001];
long b[100001];
Data map[300010] = {0};
int state_map[300010] = {0};
Data taboo[300010];
int state_taboo[300010] = {0};
long ans[10] = {0};
int dx[] = {-1, 0, 1};
int dy[] = {-1, 0, 1};


long hash(long key, long count) {
	return (key + count) % 300007;
}

void insert_map(long key) {
	int i, k;
	
	i = 0;
	k = hash(key, i++);
	while(state_map[k] == FULL) {
		k = hash(key, i++);
	}
	
	map[k].key = key;
	map[k].flag = 1;
	state_map[k] = FULL;
}

int search_map(long key) {
	int i, k;
	
	i = 0;
	k = hash(key, i++);
	while(state_map[k] != EMPTY) {
		if(state_map[k] == FULL && map[k].key == key) {
			return map[k].flag;
		}
		k = hash(key, i++);
	}
	
	return 0;
}

void insert_taboo(long key) {
	int i, k;
	
	i = 0;
	k = hash(key, i++);
	while(state_taboo[k] == FULL) {
		k = hash(key, i++);
	}
	
	taboo[k].key = key;
	taboo[k].flag = 1;
	state_taboo[k] = FULL;
}

long search_taboo(long key) {
	int i, k;
	
	i = 0;
	k = hash(key, i++);
	while(state_taboo[k] != EMPTY) {
		if(state_taboo[k] == FULL && taboo[k].key == key) {
			return taboo[k].flag;
		}
		k = hash(key, i++);
	}
	
	return 0;
}

int main() {
	int i, j, k, x, y, xx, yy, ii, jj;
	int count;
	long sum;
	
	scanf("%ld %ld %ld", &H, &W, &N);
	for(i=0;i<N;i++) {
		scanf("%ld %ld", &a[i], &b[i]);
		insert_map(a[i] * W + b[i]);
	}
	
	for(k=0;k<N;k++) {
		yy = a[k];
		xx = b[k];
		for(i=0;i<3;i++) {
			for(j=0;j<3;j++) {
				y = yy + dy[i];
				x = xx + dx[j];
				
				if(search_taboo(y * W + x)) continue;
				if(y <= 1 || y >= H || x <= 1 || x >= W) continue;
			
				insert_taboo(y * W + x);
				count = 0;
				for(ii=0;ii<3;ii++) {
					for(jj=0;jj<3;jj++) {
						if(search_map((y+dy[ii]) * W + (x+dx[jj]))) {
							count++;
						}
					}
				}
				ans[count]++;
			}
		}
	}

	sum = 0;
	for(i=1;i<=9;i++) {
		sum += ans[i];
	}
	
	ans[0] = (H * W) - (2 * H + 2 * W) + 4 - sum;

	for(i=0;i<=9;i++) {
		printf("%ld\n", ans[i]);
	}
	
	return 0;
}