#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 1e3 + 9;
int n, m, p[N], R[N];
char S[N], A[N][N];

using vec = bitset<N>;

vec a[N], b[N], c[N];

bool can[N], key[N], alt[N], oo[N];

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  L (i, 0, n - 1) {
    cin >> S;
    L (j, 0, m - 1) {
      a[i].set(j, S[j] == '1');
    }
  }
  L (i, 0, n - 1) {
    b[i] = a[i];
    c[i].set(i);
    p[i] = i;
    R[i] = -1;
  } 
  int cur = 0;
  L (r, 0, m - 1) {
    int t = -1;
    L (i, cur, n - 1) {
      if (b[i].test(r)) {
        t = i;
        break;
      }
    }
    if (t == -1) {
      continue;
    }
    swap(b[cur], b[t]);
    swap(p[cur], p[t]);
    R[p[cur]] = r;
    L (i, 0, n - 1) {
      if ((i ^ cur) && b[i].test(r)) {
        b[i] ^= b[cur];
        c[p[i]] ^= c[p[cur]];
      }
    }
    ++cur;
  }
  L (i, 0, cur - 1) {
    int t = p[i];
    key[R[t]] = true;
    if (b[i]._Find_next(R[t]) >= m) {
      can[R[t]] = true;
    }
  }
  L (i, 0, n - 1) {
    if (R[i] == -1) {
      for (int k = c[i]._Find_first(); k < n; k = c[i]._Find_next(k)) {
        alt[k] = true;
      }
    }
  }
  L (i, 0, n - 1) {
    if (alt[i]) {
      L (j, 0, m - 1) {
        if (key[j]) {
          A[i][j] = can[j] ? '0' : '+';
        } else {
          A[i][j] = '+';
        }
      }
    } else {
      L (j, 0, m - 1) {
        A[i][j] = '0';
      }
      L (j, 0, cur - 1) {
        int t = p[j];
        if (c[t].test(i) && can[R[t]]) {
          A[i][R[t]] = '-';
        }
      }
    }
  }
  L (i, 0, n - 1) {
    cout << A[i] << '\n';
  }
}
// I love WHQ!