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: Wrong Answer)

import java.util.HashSet;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		long h=sc.nextInt();
		long w=sc.nextInt();
		int n=sc.nextInt();
		HashSet<Long> hs1=new HashSet<>();
		HashSet<Long> hs2=new HashSet<>();
		for(int i=0;i<n;i++){
			long a=sc.nextInt()-1;
			long b=sc.nextInt()-1;
			hs1.add(a*w+b);
		}
		long[] count=new long[10];
		count[0]=(h-2)*(w-2);
		
		for(long l:hs1){
			long a=l/w;
			long b=l%w;
			for(long i=a-1;i<a+1;i++){
				for(long j=b-1;j<=b+1;j++){
					if(i>0 && i<h-1 && j>0 && j<w-1 && !hs2.contains(i*w+j)){
						int temp=0;
						
						for(long ii=i-1;ii<=i+1;ii++){
							for(long jj=j-1;jj<=j+1;jj++){
								if(hs1.contains(ii*w+jj))temp++;
							}
						}
						count[temp]++;
						count[0]--;
						hs2.add(i*w+j);
						
					}
				}
			}
		}
		for(int i=0;i<10;i++)System.out.println(count[i]);
	}
			
}