description: You have received data from a Bubble bot. You know your task is to make factory facilities, but before you even start, you need to know how big the factory is and how many rooms it has. When you look at the data you see that you have the dimensions of the construction, which is in rectangle shape: N x M. 
  
  Then in the next N lines you have M numbers. These numbers represent factory tiles and they can go from 0 to 15. Each of these numbers should be looked in its binary form. Because from each number you know on which side the tile has walls. For example number 10 in it's binary form is 1010, which means that it has a wall from the North side, it doesn't have a wall from the East, it has a wall on the South side and it doesn't have a wall on the West side. So it goes North, East, South, West. 
  
  It is guaranteed that the construction always has walls on it's edges. The input will be correct. 
  
  Your task is to print the size of the rooms from biggest to smallest. 
  
  Input
  
  The first line has two numbers which are N and M, the size of the construction. Both are integers: 
  
  n (1 ≤ n ≤ 10^3)
  
  m (1 ≤ m ≤ 10^3)
  
  Next N x M numbers represent each tile of construction.
  
  Output
  
  Once you finish processing the data your output consists of one line sorted from biggest to smallest room sizes. 
  
  Example
  
  Input
  
  
  4 5
  9 14 11 12 13
  5 15 11 6 7
  5 9 14 9 14
  3 2 14 3 14
  
  
  Output
  
  
  9 4 4 2 1 
solution: import java.io.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.io.BufferedWriter;
  import java.util.InputMismatchException;
  import java.io.IOException;
  import java.util.ArrayList;
  import java.io.Writer;
  import java.io.OutputStreamWriter;
  import java.util.Collections;
  import java.io.InputStream;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   *
   * @author Manav
   */
  public class Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          OutputWriter out = new OutputWriter(outputStream);
          JRobotFactory solver = new JRobotFactory();
          solver.solve(1, in, out);
          out.close();
      }
  
      static class JRobotFactory {
          static int currentVal = 0;
  
          public static boolean n(int a) {
              return ((1 << 3) & a) == 0;
          }
  
          public static boolean e(int a) {
              return ((1 << 2) & a) == 0;
          }
  
          public static boolean s(int a) {
              return ((1 << 1) & a) == 0;
          }
  
          public static boolean w(int a) {
              return ((1 << 0) & a) == 0;
          }
  
          public static void dfs(int[][] a, int[][] visited, int i, int j, int n, int m, int iterator) {
              if (i < n && j < m && i >= 0 && j >= 0 && visited[i][j] == 0) {
                  currentVal++;
                  visited[i][j] = iterator;
                  int current = a[i][j];
                  if (n(current)) {
                      dfs(a, visited, i - 1, j, n, m, iterator);
                  }
                  if (e(current)) {
                      dfs(a, visited, i, j + 1, n, m, iterator);
                  }
                  if (s(current)) {
                      dfs(a, visited, i + 1, j, n, m, iterator);
                  }
                  if (w(current)) {
                      dfs(a, visited, i, j - 1, n, m, iterator);
                  }
              }
          }
  
          public void solve(int testNumber, InputReader in, OutputWriter out) {
              int n = in.nextInt(), m = in.nextInt();
              int[][] a = new int[n][m];
              for (int i = 0; i < n; i++) {
                  for (int j = 0; j < m; j++) {
                      a[i][j] = in.nextInt();
                  }
              }
              int[][] visited = new int[n][m];
  
              ArrayList<Integer> ans = new ArrayList<>();
              int iterator = 1;
              for (int i = 0; i < n; i++) {
                  for (int j = 0; j < m; j++) {
                      if (visited[i][j] == 0) {
                          currentVal = 0;
                          dfs(a, visited, i, j, n, m, iterator);
                          ans.add(currentVal);
                          iterator++;
                      }
                  }
              }
              Collections.sort(ans, Collections.reverseOrder());
              StringBuffer buffer = new StringBuffer();
              for (int i = 0; i < ans.size(); i++) {
                  buffer.append(ans.get(i)).append(' ');
              }
              out.println(buffer);
          }
  
      }
  
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private InputReader.SpaceCharFilter filter;
  
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1) {
                  throw new InputMismatchException();
              }
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) {
                      return -1;
                  }
              }
              return buf[curChar++];
          }
  
          public int nextInt() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null) {
                  return filter.isSpaceChar(c);
              }
              return isWhitespace(c);
          }
  
          public static boolean isWhitespace(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
  
          }
  
      }
  
      static class OutputWriter {
          private final PrintWriter writer;
  
          public OutputWriter(OutputStream outputStream) {
              writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
          }
  
          public OutputWriter(Writer writer) {
              this.writer = new PrintWriter(writer);
          }
  
          public void print(Object... objects) {
              for (int i = 0; i < objects.length; i++) {
                  if (i != 0) {
                      writer.print(' ');
                  }
                  writer.print(objects[i]);
              }
          }
  
          public void println(Object... objects) {
              print(objects);
              writer.println();
          }
  
          public void close() {
              writer.close();
          }
  
      }
  }
  
  