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.util.*;
  import java.io.*;
  
  public class J implements Runnable {
      public void solve() throws IOException {
          solve(read.intNext(), read.intNext());
      }
  
      public void solve(int h, int w) throws IOException {
          byte wall[][] = new byte[h][w];
          for (int i = 0; i < h; i++) {
              for (int j = 0; j < w; j++) {
                  wall[i][j] = (byte)(read.intNext());
              }
          }
  
          boolean visited[][] = new boolean[h][w];
  
          LinkedList<Integer> size = new LinkedList<>();
  
          for (int i = 0; i < h; i++) {
              for (int j = 0; j < w; j++) {
                  if (!visited[i][j]) size.add(flood(wall, visited, i, j));
              }
          }
  
          size.sort(new Comparator<Integer>() {
              @Override
              public int compare(Integer o1, Integer o2) {
                  return o2 - o1;
              }
          });
  
          for (Integer i: size) out.print(i + " ");
      }
  
      public int flood(byte wall[][], boolean visits[][], int y, int x) {
          int s = 0;
  
          Stack<int[]> updates = new Stack<>();
          updates.add(new int[]{y, x});
          visits[y][x] = true;
  
          int t[];
          while (updates.size() != 0) {
              t = updates.pop();
              s++;
  
              if ((wall[t[0]][t[1]] & 8) == 0) {
                  if (t[0] > 0) {
                      if (!visits[t[0] - 1][t[1]]) {
                          visits[t[0] - 1][t[1]] = true;
                          updates.add(new int[]{t[0] - 1, t[1]});
                      }
                  }
              }
  
              if ((wall[t[0]][t[1]] & 4) == 0) {
                  if (t[1] < wall[0].length - 1) {
                      if (!visits[t[0]][t[1] + 1]) {
                          visits[t[0]][t[1] + 1] = true;
                          updates.add(new int[]{t[0], t[1] + 1});
                      }
                  }
              }
  
              if ((wall[t[0]][t[1]] & 2) == 0) {
                  if (t[0] < wall.length - 1) {
                      if (!visits[t[0] + 1][t[1]]) {
                          visits[t[0] + 1][t[1]] = true;
                          updates.add(new int[]{t[0] + 1, t[1]});
                      }
                  }
              }
  
              if ((wall[t[0]][t[1]] & 1) == 0) {
                  if (t[1] > 0) {
                      if (!visits[t[0]][t[1] - 1]) {
                          visits[t[0]][t[1] - 1] = true;
                          updates.add(new int[]{t[0], t[1] - 1});
                      }
                  }
              }
          }
  
          return s;
      }
  
      /************************************************************************************************************************************************/
      public static void main(String[] args) throws IOException {
          new Thread(null, new J(), "1", 1 << 26).start();
      }
  
      static PrintWriter out = new PrintWriter(System.out);
      static Reader read = new Reader();
      static StringBuilder sbr = new StringBuilder();
      static int mod = (int) 1e9 + 7;
      static int dmax = Integer.MAX_VALUE;
      static long lmax = Long.MAX_VALUE;
      static int dmin = Integer.MIN_VALUE;
      static long lmin = Long.MIN_VALUE;
      static int[] dprimes = new int[] { 1, 11, 101, 1087, 99991, 100001, 1000003, 15485863, 999999937 };
  
      @Override
      public void run() {
          try {
              solve();
          } catch (IOException e) {
              e.printStackTrace();
          }
          out.close();
      }
  
  
  static class Reader {
          private byte[] buf = new byte[1024];
          private int index;
          private InputStream in;
          private int total;
  
          public Reader() {
              in = System.in;
          }
  
          public int scan() throws IOException {
              if (total < 0)
                  throw new InputMismatchException();
              if (index >= total) {
                  index = 0;
                  total = in.read(buf);
                  if (total <= 0)
                      return -1;
              }
              return buf[index++];
          }
  
          public int intNext() throws IOException {
              int integer = 0;
              int n = scan();
              while (isWhiteSpace(n))
                  n = scan();
              int neg = 1;
              if (n == '-') {
                  neg = -1;
                  n = scan();
              }
              while (!isWhiteSpace(n)) {
                  if (n >= '0' && n <= '9') {
                      integer *= 10;
                      integer += n - '0';
                      n = scan();
                  } else
                      throw new InputMismatchException();
              }
              return neg * integer;
          }
  
          public double doubleNext() throws IOException {
              double doub = 0;
              int n = scan();
              while (isWhiteSpace(n))
                  n = scan();
              int neg = 1;
              if (n == '-') {
                  neg = -1;
                  n = scan();
              }
              while (!isWhiteSpace(n) && n != '.') {
                  if (n >= '0' && n <= '9') {
                      doub *= 10;
                      doub += n - '0';
                      n = scan();
                  } else
                      throw new InputMismatchException();
              }
              if (n == '.') {
                  n = scan();
                  double temp = 1;
                  while (!isWhiteSpace(n)) {
                      if (n >= '0' && n <= '9') {
                          temp /= 10;
                          doub += (n - '0') * temp;
                          n = scan();
                      } else
                          throw new InputMismatchException();
                  }
              }
              return doub * neg;
          }
  
          public String read() throws IOException {
              StringBuilder sb = new StringBuilder();
              int n = scan();
              while (isWhiteSpace(n))
                  n = scan();
              while (!isWhiteSpace(n)) {
                  sb.append((char) n);
                  n = scan();
              }
              return sb.toString();
          }
  
          private boolean isWhiteSpace(int n) {
              if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1)
                  return true;
              return false;
          }
      }
  
      static void print(Object object) {
          out.print(object);
      }
  
      static void println(Object object) {
          out.println(object);
      }
  
      static int[] iArr(int len) {
          return new int[len];
      }
  
      static long[] lArr(int len) {
          return new long[len];
      }
  
      static long min(long a, long b) {
          return Math.min(a, b);
      }
  
      static int min(int a, int b) {
          return Math.min(a, b);
      }
  
      static long max(Long a, Long b) {
          return Math.max(a, b);
      }
  
      static int max(int a, int b) {
          return Math.max(a, b);
      }
  
      static int ri() {
          try {
              return read.intNext();
          } catch (IOException e) {
              e.printStackTrace();
          }
          System.exit(2);
          return -1;
      }
  
      static long rl() {
          try {
              return Long.parseLong(read.read());
          } catch (IOException e) {
              e.printStackTrace();
          }
          System.exit(2);
          return -1;
      }
  
      static String rs() {
          try {
              return read.read();
          } catch (IOException e) {
              e.printStackTrace();
          }
          System.exit(2);
          return "";
      }
  
      static char rc() {
          return rs().charAt(0);
      }
  
      static double rd() {
          try {
              return read.doubleNext();
          } catch (IOException e) {
              e.printStackTrace();
          }
          System.exit(2);
          return -1;
      }
  }
  