dayin

#define MID (n / 2 - 2)
#include<bits/stdc++.h>

using namespace std;

const int N = 1e2 + 5, M = 1e3 + 5;

int n, m, fa[N][M];
char a[N][M];
int findfa(int number) {
	int x = number / m, y = number % m + 1;
	if (fa[x][y] != number)
		fa[x][y] = findfa(fa[x][y]);
	return fa[x][y];
}

bool check(int j) {
	int fz = 0, fm = 0;
	for (int l = j; l <= j + 4; ++l) {
		++fm;
		fz += a[MID][l] == '1';
	}
	return 1.0 * fz / fm >= 0.8;
}

bool check2(int j) {//black
	int fz = 0, fm = 0;
	for (int l = j; l >= j - 4; --l) {
		++fm;
		fz += a[MID][l] == '0';
	}
	return 1.0 * fz / fm >= 0.8;
}

int main() {
	freopen("1746951982.7530556.0.in", "r", stdin);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j)
			scanf(" %c", &a[i][j]);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j) {
			int fz = 0, fm = 0;
			for (int k = max(1, i - 2); k <= min(n, i + 2); ++k)
				for (int l = max(1, j - 2); l <= min(m, j + 2); ++l) {
					fz += (a[k][l] == '1'), ++fm;
				}
			if (1.0 * fz / fm >= 0.9)
				a[i][j] = '1';
			else if (1.0 * fz / fm <= 0.1)
				a[i][j] = '0';
			fa[i][j] = i * m + j - 1;
			if (i > 1 && a[i - 1][j] == a[i][j]) {
				findfa(fa[i][j]), findfa(fa[i - 1][j]);
				fa[i][j] = fa[i - 1][j];
			}
			if (j > 1 && a[i][j - 1] == a[i][j]) {
				findfa(fa[i][j]), findfa(fa[i][j - 1]);
				fa[i][j] = fa[i][j - 1];
			}
		}
	for (int j = 1; j <= 100; ++j)
		cout << fa[n / 2][j]<< ' ' ;
	return 0;
	string ans = "";
	for (int i = MID, j = 1, sta = 0, las = -1; j <= m; ++j) {
		if (j == m || (check2(j - 1) && a[i][j - 1] == '0' && a[i][j] == '1' && check(j))) {
			cout << j << ' ' <<sta << endl;
			if (sta == 0) {
				las = findfa(fa[i][j - 1]);
				sta = 1;
			} else if (sta == 1) {
				if (findfa(fa[i - 1][j]) == las)
					ans = ans + '1';
				else {
					ans = ans + '0';
					sta = 2;
				}
			} else if (sta == 2) {
				sta = 0;
				las = findfa(fa[i - 1][j]);
			}
			
		}
	}
	cout << ans << endl;
	return 0;
}