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.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;

public class BB486 implements Runnable {

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok = new StringTokenizer("");

	public static void main(String[] args) {
		new Thread(null, new BB486(), "", 256 * (1L << 20)).start();
	}

	public void run() {
		try {
			long t1 = System.currentTimeMillis();
			if (System.getProperty("ONLINE_JUDGE") != null) {
				in = new BufferedReader(new InputStreamReader(System.in));
				out = new PrintWriter(System.out);
			} else {
				in = new BufferedReader(new FileReader("input.txt"));
				out = new PrintWriter(System.out);
			}
			Locale.setDefault(Locale.US);
			solve();
			in.close();
			out.close();
			long t2 = System.currentTimeMillis();
			System.err.println("Time = " + (t2 - t1));
		} catch (Throwable t) {
			t.printStackTrace(System.err);
			System.exit(-1);
		}
	}

	String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	int readInt() throws IOException {
		return Integer.parseInt(readString());
	}

	long readLong() throws IOException {
		return Long.parseLong(readString());
	}

	double readDouble() throws IOException {
		return Double.parseDouble(readString());
	}

	// solution
	int choose(int total, int choose){
	    if(total < choose)
	        return 0;
	    if(choose == 0 || choose == total)
	        return 1;
	    return choose(total-1,choose-1)+choose(total-1,choose);
	}
	
	void solve() throws IOException {
		int m = readInt();
		int n = readInt();
		int[][] mn = new int[m][n];
		int[][] outM = new int[m][n];
		boolean isTrue = true;
		boolean[] rows = new boolean[m];
		boolean[] columns = new boolean[n];
		int num1 = 0;
		for(int i =0; i<m; i++){
			for(int j=0; j<n; j++){
				mn[i][j] = readInt();
				if(mn[i][j]==1)num1++;
			}
		}
		for(int i =0; i<m; i++){
			int count =0;
			for(int j=0; j<n; j++){
				if(mn[i][j] ==1)count++;
			}
			if(count == mn[0].length){
				rows[i] = true;
			}
			if(!(count==0||count==mn[0].length)){
			
			}
		}
		for(int i =0; i<n; i++){
			int count =0;
			for(int j=0; j<m; j++){
				if(mn[j][i] ==1)count++;
			}
			if(count == mn.length){
				columns[i] = true;
			}
			if(!(count==0||count==mn.length)){

			}
		}
		int countr = 0;
		for(int i=0; i<m; i++){
			if(rows[i]) countr++;
		}
		int countc = 0;
		for(int j=0; j<n; j++){
			if(columns[j]) countc++;
		}
		if((countr>0&&countc>0)||num1==0){
			
		}else{
			isTrue = false;
		}
		for(int i=0; i<m; i++){
			for(int j=0; j<n; j++){
				if(mn[i][j]==1){
					if(!(rows[i]||columns[j])){
						isTrue = false;
					}
				}
			}
		}
		for(int i=0; i<m; i++){
			for(int j=0; j<n; j++){
				if(rows[i]&&columns[j]){
					outM[i][j]=1;
				}
			}
		}
		if(isTrue){
			out.println("YES");
			for(int i=0; i<m; i++){
				for(int j=0; j<n; j++){
					out.print(outM[i][j]+" ");
				}
				out.println();
			}
		}else{
			out.println("NO");
		}
	}
}