1 #include <bits/stdc++.h>
 2 using namespace std;
 3 #define N 1000010
 4 struct Edge {
 5     int v, nxt;
 6 } edge[N*8];
 7 int head[N], tot, sz[N], dfn[N], low[N], vis[N], ans[N], tid, mp[1010][1010], cnt;
 8
 9 void Add(int u, int v) {
10     edge[tot] = (Edge) {v, head[u]}; head[u] = tot++;
11     edge[tot] = (Edge) {u, head[v]}; head[v] = tot++;
12 }
13
14 void dfs(int u) {
15     sz[u] = 1; if(cnt < u) cnt = u;
16     vis[u] = 1;
17     for(int i = head[u]; ~i; i = edge[i].nxt) {
18         int v = edge[i].v;
19         if(vis[v]) continue;
20         dfs(v);
21         sz[u] += sz[v];
22     }
23 }
24
25 void tarjan(int u, int fa) {
26     dfn[u] = low[u] = ++tid;
27     vis[u] = 1;
28     for(int i = head[u]; ~i; i = edge[i].nxt) {
29         int v = edge[i].v;
30         if(fa == v) continue;
31         if(!dfn[v]) {
32             tarjan(v, u);
33             low[u] = min(low[u], low[v]);
34             if(low[v] >= dfn[u]) ans[u] += sz[v];
35         } else if(vis[v]) {
36             low[u] = min(low[u], dfn[v]);
37         }
38     }
39 }
40
41 int main() {
42     int n, m;
43     scanf("%d%d", &n, &m);
44     for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) scanf("%d", &mp[i][j]);
45     memset(head, -1, sizeof(head));
46     for(int i = 0; i <= n; i++) {
47         for(int j = 0; j <= m; j++) {
48             if(mp[i][j] != mp[i+1][j]) Add(mp[i][j], mp[i+1][j]);
49             if(mp[i][j] != mp[i][j+1]) Add(mp[i][j], mp[i][j+1]);
50         }
51     }
52     dfs(0);
53     memset(vis, 0, sizeof(vis));
54     tarjan(0, -1);
55     for(int i = 1; i <= cnt; i++) printf("%d ", ans[i]);
56     return 0;
57 }