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# (Mono 4.6.2.0) (judge verdict: Time Limit Exceeded)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;


public class AtCoder {
    static long H, W, N;
    static long[] masucnt = new long[10];
    static Dictionary<Pair<int, int>, bool> D = new Dictionary<Pair<int, int>, bool>();
    static void Main() {
        HashSet<Pair<int, int>> HS = new HashSet<Pair<int, int>>();
        int[] q = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
        H = q[0];
        W = q[1];
        N = q[2];
        int[] hs = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };
        int[] ws = { -1, -1, -1, 0, 0, 0, 1, 1, 1 };
        Pair<int, int>[] Pairs = new Pair<int, int>[N];
        for(int i = 0; i < N; i++) {
            q = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            Pair<int, int> P = new Pair<int, int>(q[0], q[1]);
            D.Add(P, true);
            Pairs[i] = P;
        }
        for(int i = 0; i < N; i++) {
   for(int j = 0; j < 9; j++) {
                Pair<int, int> P = new Pair<int, int>(Pairs[i].First + hs[j], Pairs[i].Second + ws[j]);
                if ((HS.Add(P))&&P.First>1&&P.First<H&&P.Second>1&&P.Second<W) {
                    int cnt = 0;
               //     Console.WriteLine(P.tostring());
                    for(int k = 0; k < 9; k++) {
                        if(D.ContainsKey(new Pair<int, int>(P.First + hs[k], P.Second + ws[k]))) {
                            cnt++;
                        }
                    }
                    masucnt[cnt]++;
                }
                
            }
        }
        masucnt[0] = (H - 2) * (W - 2);
        for(int i = 1; i < 10; i++) {
            masucnt[0] -= masucnt[i];
        }
        for (int i = 0; i < 10; i++) {
            Console.WriteLine(masucnt[i]);
        }
    }

}
public struct Pair<T, U> {
    

    public Pair(T first, U second) {
        this.First = first;
        this.Second = second;
    }
    public string tostring() {
        return First + " " + Second;
    }
    public T First { get; set; }
    public U Second { get; set; }
}