#include <bits/stdc++.h>
using namespace std;
const int N = 1605;
int n, m, res[N], sum;
int g[N][N], p[N][N];
int bel[N][N], cnt;
int dx[] = {1, 1, 1, 0, 0, -1, -1, -1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void dfs(int x, int y) {
  if (!g[x][y] || bel[x][y]) return;
  bel[x][y] = cnt;
  for (int i = 0; i < 8; ++i) dfs(x + dx[i], y + dy[i]);
}
void DFS(int x, int y) {
  if (p[x][y] != 1) return;
  p[x][y] = 2, ++sum;
  for (int i = 0; i < 8; ++i) DFS(x + dx[i], y + dy[i]);
}
void work() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) scanf("%d", &g[i][j]);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (g[i][j] && !bel[i][j]) {
        ++cnt;
        dfs(i, j);
      }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      if (!g[i][j]) continue;
      for (int k = 0; k < 8; ++k) {
        if (!g[i + dx[k]][j + dy[k]]) {
          g[i][j] = 2;
          break;
        }
      }
    }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      if (g[i][j] != 1) continue;
      int x = 0;
      for (int k = 0; k < 8; ++k) {
        if (g[i + dx[k]][j + dy[k]] == 1) {
          ++x;
        }
      }
      if (x < 5) p[i][j] = 1;
    }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      if (p[i][j] != 1) continue;
      sum = 0;
      DFS(i, j);
      if (sum > 5) ++res[bel[i][j]];
    }
  sort(res + 1, res + 1 + cnt);
  printf("%d\n", cnt);
  for (int i = 1; i <= cnt; ++i) printf("%d%c", res[i], " \n"[i == cnt]);
}
int main() {
  work();
  return 0;
}
