A finite field F_{2} consists of two elements: 0 and 1. Addition and multiplication on F_{2} are those on integers modulo two, as defined below.


A set of vectors $v_1, ... , v_k$ over F_{2} with the same dimension is said to be linearly independent when, for $c_1, ... , c_k \in $ F_{2}, $c_1v_1 + ... + c_kv_k = 0$ is equivalent to $c_1 = ... = c_k = 0$, where $0$ is the zero vector, the vector with all its elements being zero.
The rank of a matrix is the maximum cardinality of its linearly independent sets of column vectors. For example, the rank of the matrix $ \left[ \begin{array}{rrr} 0 & 0 & 1 \\ 1 & 0 & 1 \end{array} \right] $ is two; the column vectors $ \left[ \begin{array}{rrr} 0 \\ 1 \end{array} \right] $ and $ \left[ \begin{array}{rrr} 1 \\ 1 \end{array} \right] $ (the first and the third columns) are linearly independent while the set of all three column vectors is not linearly independent. Note that the rank is zero for the zero matrix.
Given the above definition of the rank of matrices, the following may be an intriguing question. How does a modification of an entry in a matrix change the rank of the matrix? To investigate this question, let us suppose that we are given a matrix $A$ over F_{2}. For any indices $i$ and $j$, let $A^{(ij)}$ be a matrix equivalent to $A$ except that the $(i, j)$ entry is flipped.
\begin{equation*} A^{(ij)}_{kl}= \left \{ \begin{array}{ll} A_{kl} + 1@ & (k = i \; {\rm and} \; l = j) \\ A_{kl}@ & ({\rm otherwise}) \\ \end{array} \right. \end{equation*}In this problem, we are interested in the rank of the matrix $A^{(ij)}$. Let us denote the rank of $A$ by $r$, and that of $A^{(ij)}$ by $r^{(ij)}$. Your task is to determine, for all $(i, j)$ entries, the relation of ranks before and after flipping the entry out of the following possibilities: $(i) r^{(ij)} < r, (ii) r^{(ij)} = r$, or $(iii) r^{(ij)} > r$.
The input consists of a single test case of the following format.
$n$ $m$ $A_{11}$ ... $A_{1m}$ . . . $A_{n1}$ ... $A_{nm}$
$n$ and $m$ are the numbers of rows and columns in the matrix $A$, respectively ($1 \leq n \leq 1000, 1 \leq m \leq 1000$). In the next $n$ lines, the entries of $A$ are listed without spaces in between. $A_{ij}$ is the entry in the $i$th row and $j$th column, which is either 0 or 1.
Output $n$ lines, each consisting of $m$ characters. The character in the $i$th line at the $j$th position must be either  (minus), 0 (zero), or + (plus). They correspond to the possibilities (i), (ii), and (iii) in the problem statement respectively.
2 3 001 101
0 00
5 4 1111 1000 1000 1000 1000
0000 0+++ 0+++ 0+++ 0+++
10 10 1000001001 0000010100 0000100010 0001000001 0010000010 0100000100 1000001000 0000010000 0000100000 0001000001
00000000 00000000 00000000 +00000+000 000000000 000000000 00000000 0000000 0000000 +00000+000
1 1 0
+