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

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace D
{
    class Program
    {
        static void Main(string[] args)
        {
            var buff = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            var H = buff[0];
            var W = buff[1];
            var N = buff[2];
            var canvas = new Dictionary<Tuple<int, int>, ulong>();
            var xcanvas = new Dictionary<int, Dictionary<int, ulong>>();
            for (int i = 0; i < N; i++)
            {
                buff = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
                var a = buff[0] - 1;
                var b = buff[1] - 1;
                for (int j = 0; j < 3; j++)
                {
                    for (int k = 0; k < 3; k++)
                    {
                        var x = a - j;
                        var y = b - k;
                        if (0 <= x && x + 2 < H)
                        {
                            if (xcanvas.ContainsKey(x))
                            {
                                if (0 <= y && y + 2 < W)
                                {
                                    var ycanvas = xcanvas[x];
                                    if (ycanvas.ContainsKey(y))
                                    {
                                        ycanvas[y]++;
                                    }
                                    else
                                    {
                                        ycanvas.Add(y, 1);
                                    }
                                }
                            }
                            else if (0 <= y && y + 2 < W)
                            {
                                var ycanvas = new Dictionary<int, ulong>();
                                ycanvas.Add(y, 1);
                                xcanvas.Add(x, ycanvas);
                            }
                        }
                    }
                }
            }
            var ans = new ulong[10];
            foreach (var x in xcanvas)
            {
                foreach(var y in x.Value)
                {
                    ans[y.Value]++;
                }
            }
            ulong zero = (ulong)(H - 2) * (ulong)(W - 2);
            foreach(var a2 in ans)
            {
                zero -= a2;
            }
            ans[0] = zero;
            foreach (var a2 in ans)
            {
                Console.WriteLine(a2);
            }

        }
    }
}