Problem: Let's define logical OR as an operation on two logical values (i. e. values that belong to the set {0, 1}) that is equal to 1 if either or both of the logical values is set to 1, otherwise it is 0. We can define logical OR of three or more logical values in the same manner:

<image> where <image> is equal to 1 if some ai = 1, otherwise it is equal to 0.

Nam has a matrix A consisting of m rows and n columns. The rows are numbered from 1 to m, columns are numbered from 1 to n. Element at row i (1 ≤ i ≤ m) and column j (1 ≤ j ≤ n) is denoted as Aij. All elements of A are either 0 or 1. From matrix A, Nam creates another matrix B of the same size using formula:

<image>.

(Bij is OR of all elements in row i and column j of matrix A)

Nam gives you matrix B and challenges you to guess matrix A. Although Nam is smart, he could probably make a mistake while calculating matrix B, since size of A can be large.

Input

The first line contains two integer m and n (1 ≤ m, n ≤ 100), number of rows and number of columns of matrices respectively.

The next m lines each contain n integers separated by spaces describing rows of matrix B (each element of B is either 0 or 1).

Output

In the first line, print "NO" if Nam has made a mistake when calculating B, otherwise print "YES". If the first line is "YES", then also print m rows consisting of n integers representing matrix A that can produce given matrix B. If there are several solutions print any one.

Examples

Input

2 2
1 0
0 0


Output

NO


Input

2 3
1 1 1
1 1 1


Output

YES
1 1 1
1 1 1


Input

2 3
0 1 0
1 1 1


Output

YES
0 0 0
0 1 0

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class ORInMatrix {

	public static void main(String[] args) {

		BufferedReader br = null;

		br = new BufferedReader(new InputStreamReader(System.in));

		try {
			int m, n;

			String[] temp;

			temp = br.readLine().split(" ");

			m = Integer.parseInt(temp[0]);
			n = Integer.parseInt(temp[1]);
			int i, j;

			int[][] matrixB = new int[m][n];

			for (i = 0; i < m; i++) {
				temp = br.readLine().split(" ");
				for (j = 0; j < n; j++) {
					matrixB[i][j] = Integer.parseInt(temp[j]);
				}
			}

			int[] oneZeroRows = new int[m];
			int[] oneZeroCols = new int[n];

			for (i = 0; i < m; i++) {
				oneZeroRows[i] = 0;
				for (j = 0; j < n; j++) {
					if (matrixB[i][j] == 0) {
						oneZeroRows[i] = 1;
						break;
					}
				}
			}

			for (j = 0; j < n; j++) {
				oneZeroCols[j] = 0;
				for (i = 0; i < m; i++) {
					if (matrixB[i][j] == 0) {
						oneZeroCols[j] = 1;
						break;
					}
				}
			}

			int[][] guessMatrixA = new int[m][n];

			for (i = 0; i < m; i++)
				for (j = 0; j < n; j++)
					if (oneZeroRows[i] == 1 || oneZeroCols[j] == 1) {
						guessMatrixA[i][j] = 0;
					} else {
						guessMatrixA[i][j] = 1;
					}

			int[] oneOneRows = new int[m];
			int[] oneOneCols = new int[n];

			for (i = 0; i < m; i++) {
				oneOneRows[i] = 0;
				for (j = 0; j < n; j++) {
					if (guessMatrixA[i][j] == 1) {
						oneOneRows[i] = 1;
						break;
					}
				}
			}

			for (j = 0; j < n; j++) {
				oneOneCols[j] = 0;
				for (i = 0; i < m; i++) {
					if (guessMatrixA[i][j] == 1) {
						oneOneCols[j] = 1;
						break;
					}
				}
			}

			int guessMatrixB[][] = new int[m][n];

			for (i = 0; i < m; i++)
				for (j = 0; j < n; j++)
					if (oneOneRows[i] == 1 || oneOneCols[j] == 1) {
						guessMatrixB[i][j] = 1;
					} else {
						guessMatrixB[i][j] = 0;
					}

			boolean correct = true;

			for (i = 0; i < m; i++)
				for (j = 0; j < n; j++)
					if (matrixB[i][j] != guessMatrixB[i][j]) {
						correct = false;
						break;
					}

			if (!correct) {
				System.out.println("NO");
			} else {
				System.out.println("YES");

				for (i = 0; i < m; i++) {
					System.out.print(guessMatrixA[i][0]);

					for (j = 1; j < n; j++)
						System.out.print(" " + guessMatrixA[i][j]);

					System.out.println();
				}
			}

		} catch (Exception e) {
			e.printStackTrace();
		}

	}
}