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 Java8 (OpenJDK 1.8.0) (judge verdict: Memory Limit Exceeded)

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

/**
 * https://abc045.contest.atcoder.jp/tasks/arc061_b
 */
public class Main {

	static Map<String,Point> map = new HashMap<>();
	static Set<String> checked = new HashSet<>();
	static long H;
	static long W;
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		H = Long.parseLong(sc.next());
		W = Long.parseLong(sc.next());
		int N = Integer.parseInt(sc.next());
		for(int i=0; i<N; i++){
			Point p = new Point(Integer.parseInt(sc.next()), Integer.parseInt(sc.next()));
			map.put(getKey(p.x,p.y), p);
		}
		sc.close();
		
		long[] ans = new long[10];
		for(Point p:map.values()){
			for(int x=0; x<=2; x++){
				for(int y=0; y<=2; y++){
					int count = count(p.x-x,p.y-y);
					if(count>0){
						ans[count]++;
					}
				}
			}
		}
		long sum = 0;
		for(int i=1; i<=9; i++){
			ans[i] = ans[i]/i;
			sum+=ans[i];
		}
		ans[0] = (H-2)*(W-2)-sum;
		for(long a:ans){
			System.out.println(a);
		}
	}
	
	static int count(int x, int y){
		int count = 0;
		//if(checked.contains(getKey(x,y))) return -1;
		if( x<=0 || y<=0 || x>W-2 || y>H-2 ) return -1;
		for(int i=0; i<=2; i++){
			for(int j=0; j<=2; j++){
				if(map.containsKey(getKey(x+i,y+j))){
					count++;
				}
			}
		}
		//checked.add(getKey(x,y));
		return count;
	}
	
	static String getKey(int x, int y){
		return x+"."+y;
	}
	
	static class Point{
		int x;
		int y;
		Point(int y, int x){
			this.x = x;
			this.y = y;
		}
	}

}