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: Accepted)

import java.util.*;

public class Main {
	
       public static void main(String[] args) {
    	  Scanner in=new Scanner( System.in)	;
          long n=in.nextLong(),m=in.nextLong(),k=in.nextLong();
          HashMap<pointt,Long> map=new HashMap<pointt,Long>();
          //TreeMap<pointt,Long> map=new TreeMap<pointt,Long>();
          for(int i=1;i<=k;i++)
          {
        	 int a=in.nextInt();
        	 int b=in.nextInt();
        	 for(int x=Math.max(1, a-2);x<=Math.min(n-2, a);x++)
        		 for(int y=Math.max(1, b-2);y<=Math.min(m-2, b);y++)
        		 {
        			 pointt p=new pointt(x, y);
                	 Long v=map.get(p);
                	// System.out.println(v);
                	 if(v==null)
                	 {
                		 v=(long) 1;
                	 }
                	 else v++;
                	 
                	
                	 map.put(p, v);
                	// System.out.println(x+"  "+y);
        		 }
          }
          long[] ans=new long[15];
          ans[0]=(n-2)*(m-2);
          
          for(long value:map.values())
          {
        	  ans[(int) value]++;
              ans[0]--;  
          }
          for(int i=0;i<=9;i++)
          {
        	  System.out.println(ans[i]);
          }
	}
}
class pointt {
    int x,y;

	public pointt(int x, int y) {
		super();
		this.x = x;
		this.y = y;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + x;
		result = prime * result + y;
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		pointt other = (pointt) obj;
		if (x != other.x)
			return false;
		if (y != other.y)
			return false;
		return true;
	}
	 public int compareTo(pointt p) {
		    if (this.x != p.x) {
		      return this.x - p.x;
		    }
		    return this.y - p.y;
		  }
	
	
	
}