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: Time Limit Exceeded)

import java.io.*;
import java.util.*;

public class Main {
    public static PrintWriter out;
    public static FastScanner in;
    Map<Points,Boolean> map;
    int H,W;

    private void solve(){
        H = in.nextInt();
        W = in.nextInt();

        List<Points> list = new ArrayList<>();
        map = new HashMap<>();
        int N = in.nextInt();
        for(int i=0;i<N;i++){
            Points p = new Points(in.nextInt(),in.nextInt());
            list.add(p);
            map.put(p,true);
        }

        long[] cnt = new long[10];
        int[] dx = new int[]{-2,-2,-2,-1,-1,-1,0,0,0};
        int[] dy = new int[]{-2,-1,0,-2,-1,0,-2,-1,0};
        Map<Points,Boolean> done = new HashMap<>();
        for(Points p:list){
            int x = p.x, y =p.y;
            for(int i=0;i<9;i++){
                int nx = x+dx[i];
                int ny = y+dy[i];
                if((nx > 0 && nx<=H) && (ny >0 && ny<=W)){
                    Points p1 = new Points(nx,ny);
                    if(!done.containsKey(p1)){
                        int count = cntBlack(nx,ny);
                        if(count > 0){
                            //out.println(nx+" "+ny+ " "+count);
                            cnt[count]++;
                        }
                        done.put(p1,true);
                    }
                }
            }
        }

        long sum = 0L;
        for(int i=0;i<10;i++){
            sum+=cnt[i];
        }
        cnt[0] = ((long)(H-2)*(W-2))-sum;
        for(int i=0;i<10;i++){
            out.println(cnt[i]);
        }
    }

    private int cntBlack(int x,int y){
        int[] dx = new int[]{0,0,0,1,1,1,2,2,2};
        int[] dy = new int[]{0,1,2,0,1,2,0,1,2};
        int count = 0;
        for(int i=0;i<9;i++){
            int nx = x+dx[i];
            int ny = y+dy[i];

            if((nx > 0 && nx<=H) && (ny >0 && ny<=W)){
                if(map.containsKey(new Points(nx,ny))){
                    count++;
                }
            }else{
                count = -1;
                break;
            }
        }
        return count;
    }

    private class PointsComparator implements Comparator<Points>
    {
        @Override
        public int compare(Points o1, Points o2) {
            if(o1.x == o2.x){
                return  o1.y-o2.y;
            }
            return o1.x-o2.x;
        }
    }

    private class Points{
        int x;
        int y;

        Points(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;

            Points points = (Points) o;

            if (x != points.x) return false;
            return y == points.y;

        }

        @Override
        public int hashCode() {
            int result = x;
            result = 31 * result + y;
            return result;
        }
    }
    private void runIO() {
        in = new FastScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        solve();
        out.close();
    }
    private static class FastScanner {
        BufferedReader bufferedReader;
        StringTokenizer stringTokenizer;

        private FastScanner() {
            bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            if (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return stringTokenizer.nextToken();
        }

        private int nextInt() {
            return Integer.parseInt(next());
        }

        private long nextLong() {
            return Long.parseLong(next());
        }

        private String nextLine() {
            String ret = "";
            try {
                ret = bufferedReader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return ret;
        }
    }

    public static void main(String[] args) {
        new Main().runIO();
    }
}