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.lang.*;
import java.io.*;
import java.util.*;


public class Matrix {
	
	public static void main(String[] args) throws java.lang.Exception {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(in, out);
		out.close();
	}
}

class TaskA {
	
	public void solve(InputReader in, PrintWriter out) {
		int n = in.nextInt(), m = in.nextInt();
		int[][] b = new int[n][m];
		int[][] a = new int[n][m];
		int[][] d = new int[n][m];
		int[] rs = new int[n];
		int[] cs = new int[m];
		int i, j, k;
		
		for (i=0; i<n; ++i) {
			for (j=0; j<m; ++j) {
				b[i][j] = in.nextInt();
				a[i][j] = 1;
			}
		}
		
		for (i=0; i<n; ++i) {
			for (j=0; j<m; ++j) {
				if (b[i][j] == 0) {
					for (k=0; k<m; ++k)
						a[i][k] = 0;
					for (k=0; k<n; ++k)
						a[k][j] = 0;
				}
			}
		}
		
		for (i=0; i<n; ++i) {
			for (j=0; j<m; ++j) {
				rs[i] |= a[i][j];
				cs[j] |= a[i][j];
			}
		}
		
		for (i=0; i<n; ++i) {
			for (j=0; j<m; ++j) {
				d[i][j] = rs[i] | cs[j];
				if (d[i][j] != b[i][j]) {
					out.println("NO");
					return ;
				}
			}
		}
		
		out.println("YES");
		for (i=0; i<n; ++i) {
			for (j=0; j<m; ++j) {
				out.print(a[i][j] + " ");
			}
			out.println();
		}
	}
}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;
	
	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = null;
	}
	
	public String next() {
		while (tokenizer==null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}
	
	public int nextInt() {
		return Integer.parseInt(next());
	}
	
	public long nextLong() {
		return Long.parseLong(next());
	}
}