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.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;

public class B277 {

	public void run() throws IOException {
		Scanner in = new Scanner(System.in);

		int m = in.nextInt();
		int n = in.nextInt();

		int arr[][] = new int[m][n];
		for (int i = 0; i < m; i++)
			for (int j = 0; j < n; j++)
				arr[i][j] = in.nextInt();

		boolean fil[][] = new boolean[m][n];
		int A[][] = new int[m][n];

		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				if (arr[i][j] == 0) {

					for (int k = 0; k < m; k++) {
						A[k][j] = 0;
						fil[k][j] = true;
					}

					for (int k = 0; k < n; k++) {
						A[i][k] = 0;
						fil[i][k] = true;
					}

				}

			}
		}
		//
		// for (int i = 0; i < m; i++) {
		// for (int j = 0; j < n; j++) {
		// System.out.print(fil[i][j] + " ");
		// }
		// System.out.println();
		// }

		for (int i = 0; i < m; i++) {

			for (int j = 0; j < n; j++) {

				if (arr[i][j] == 1) {

					for (int k = 0; k < m; k++) {
						if (fil[k][j] == false) {
							fil[k][j] = true;
							A[k][j] = 1;

						}
					}

					for (int k = 0; k < n; k++) {
						if (fil[i][k] == false) {
							fil[i][k] = true;
							A[i][k] = 1;

						}

					}

				}

			}

		}

		// for (int i = 0; i < m; i++) {
		// for (int j = 0; j < n; j++) {
		// System.out.print(A[i][j] + " ");
		// }
		// System.out.println();
		// }

		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				if (fil[i][j] == false) {
					A[i][j] = 0;
				}

			}
		}
		//
		// for (int i = 0; i < m; i++) {
		// for (int j = 0; j < n; j++) {
		// System.out.print(fil[i][j] + " ");
		// }
		// System.out.println();
		// }

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

		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {

				int anss = 0;
				for (int k = 0; k < m; k++) {
					anss |= A[k][j];
				}

				for (int k = 0; k < n; k++) {
					anss |= A[i][k];

				}
				BB[i][j] = anss;

			}
		}

		// for (int i = 0; i < m; i++) {
		// for (int j = 0; j < n; j++) {
		// System.out.print(BB[i][j] + " ");
		// }
		// System.out.println();
		// }
		//
		//
		// for (int i = 0; i < m; i++) {
		// for (int j = 0; j < n; j++) {
		// System.out.print(arr[i][j] + " ");
		// }
		// System.out.println();
		// }

		boolean answer = true;

		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				if (BB[i][j] != arr[i][j]) {
					answer = false;
				}

			}
		}

		if (answer) {

			System.out.println("YES");
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++) {
					System.out.print(A[i][j] + " ");
				}
				System.out.println();
			}
		} else {

			System.out.println("NO");
		}

	}

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		new B277().run();

	}

}