#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 1010;

int n, m, p[maxn];
char s[maxn][maxn];
bool vis[maxn], mk[maxn], can[maxn], f[maxn];
bitset<maxn> a[maxn], b[maxn], c[maxn], d[maxn], e[maxn];

void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%s", s[i] + 1);
		for (int j = 1; j <= m; ++j) {
			if (s[i][j] == '1') {
				a[i].set(j);
			}
		}
		bitset<maxn> x = a[i], y;
		y.reset();
		y.set(i);
		bool fl = 1;
		for (int j = 1; j <= m; ++j) {
			if (x.test(j)) {
				if (b[j].none()) {
					b[j] = x;
					c[j] = y;
					fl = 0;
					break;
				}
				x ^= b[j];
				y ^= c[j];
			}
		}
		if (fl) {
			for (int j = 1; j <= n; ++j) {
				if (y.test(j)) {
					mk[j] = 1;
				}
			}
		}
	}
	int tot = 0;
	for (int i = 1; i <= m; ++i) {
		if (b[i].any()) {
			b[++tot] = b[i];
			c[tot] = c[i];
		}
	}
	for (int i = 1; i <= tot; ++i) {
		p[i] = b[i]._Find_first();
		vis[p[i]] = 1;
		for (int j = 1; j < i; ++j) {
			if (b[j].test(p[i])) {
				b[j] ^= b[i];
				c[j] ^= c[i];
			}
		}
	}
	for (int i = 1; i <= tot; ++i) {
		can[p[i]] = ((int)b[i].count() == 1);
	}
	for (int i = 1; i <= n; ++i) {
		if (mk[i]) {
			for (int j = 1; j <= m; ++j) {
				if (vis[j]) {
					putchar(can[j] ? '0' : '+');
				} else {
					putchar('+');
				}
			}
		} else {
			mems(f, 0);
			for (int j = 1; j <= tot; ++j) {
				if (c[j].test(i) && can[p[j]]) {
					f[p[j]] = 1;
				}
			}
			for (int j = 1; j <= m; ++j) {
				putchar(f[j] ? '-' : '0');
			}
		}
		putchar('\n');
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}