#include <stdio.h>
#include <bitset>
#include <vector>
using namespace std;

bitset<1408> wow[40040], mask;
bitset<40000> ev[202];
int N, M; char B[202][202][202];

int main()
{
	scanf ("%d %d", &N, &M);
	for (int k = 0; k < M; k++) for (int i = 0; i < N; i++) scanf ("%s", B[k][i]);

	int C = 0, L = N + N + (N - 1) * 2 + 1 + (N - 1) * 2 + 1;
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			wow[C][i] = wow[C][N + j] = wow[C][N + N + i + j] = wow[C][N + N + (N - 1) * 2 + 1 + (N - 1) - i + j] = 1;
			for (int k = 0; k < M; k++) if (B[k][i][j] == '#') wow[C][L + k] = 1;
			C++;
		}
	}

	for (int i = 0, j = 0; i < C && j < L; j++){
		for (int k = i; k < C; k++) if (wow[k][j]){
			swap(wow[i], wow[k]);
			break;
		}
		if (!wow[i][j]) continue;
		for (int k = 0; k < C; k++) if (k != i && wow[k][j]) wow[k] ^= wow[i];
		i++;
	}

	for (int i = 0; i < L; i++) mask[i] = 1;
	for (int i = 0, c = 0; i < C; i++) if ((wow[i] & mask).count() == 0){
		for (int k = 0; k < M; k++) ev[k][c] = wow[i][L + k];
		c++;
	}

	for (int i = 0; i < M-1; i++, puts("")) for (int j = i + 1; j < M; j++){
		int g = (ev[i] ^ ev[j]).count() == 0;
		printf ("%d", g);
	}

	return 0;
}