#include <bits/stdc++.h>
using namespace std;

int n;
int used[100];
int A[100][100];

void dfs(int v) {
	used[v]=1;
	for (int i = 0; i < n; ++i) {
		if (A[v][i] == 1 && used[i] == 0) {
			dfs(i);
		}
	}
}


int main(){
    cin >> a >> b;
    m.resize(a);
            for (int i = 0; i < a; ++i){
        m[i].resize(b);
    }
    char k;
    int cnt = 4;
    for (int i = 0; i < a; ++i){
        for (int j = 0;j < b; ++j){
            cin >> k;

            if ()






    vector <int> vector(cnt - 4);
    for (int i = 0; i < a; ++i){
        for (int j = 0; j < a; ++j){
            if (m[i][j] != 1){
                n.resize(0);
                mag =  0;
                dfs(i, j);
                for (int i = 0; i < n.size(); ++i){
                    vector[n[i]-4] = mag;
                }
            }
        }
    }

    cout << vector;
}