영역구하기

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
 
public class Main {
    static int m, n, k;
    
    static boolean visited[][] = new boolean[101][101];
    static int dx[] = {-1,1,0,0}, dy[] = {0,0,-1,1};
    static int tmp = 0;
    public static void main(String[] args) throws IOException{
        // TODO Auto-generated method stub
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st= new StringTokenizer(br.readLine());
        m = Integer.parseInt(st.nextToken()); // 세로 
        n = Integer.parseInt(st.nextToken()); //가로 
        k= Integer.parseInt(st.nextToken()); //사각형의 개수 
        
        
        for (int i = 0; i < k; i++) {
            st= new StringTokenizer(br.readLine());
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            int c = Integer.parseInt(st.nextToken());
            int d = Integer.parseInt(st.nextToken());
//            pos[i] = new Pos(a, b, c,d);
            for (int j = b; j < d; j++) {
                for (int k = a; k < c; k++) {
                    visited[j][k] = true;
                }
            }
        }
        
        int cnt = 0;
        ArrayList<Integer> list = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (!visited[i][j]) {
                    tmp = 1;
                    dfs(i, j);
                    list.add(tmp);
                    cnt++;
                    
                }
            }
        }
        System.out.println(cnt);
        
        Collections.sort(list);
        for (int i = 0; i < cnt; i++) {
            System.out.print(list.get(i) + " ");
        }
    }
    static void dfs(int x, int y) {
        visited[x][y] = true;
        for (int i = 0; i < 4; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            
            if (nx < 0 || nx >= m || ny < 0 || ny >= n || visited[nx][ny] ) continue;
            tmp++;
            dfs(nx, ny);
        }
    }
    static class Pos {
        int a,b,c,d;
        
        public Pos(int a, int b, int c, int d) {
            this.a = a;
            this.b = b;
            this.c = c;
            this.d = d;
        }
    }
}