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:
//package ladderB;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class orInMatrix {
	static int [][]input;
	public static boolean form(int [][] x){
		int [][] out=new int[x.length][x[0].length];
		
		for (int i = 0; i < out[0].length; i++) {
			for (int j = 0; j < out.length; j++) {
			if(x[j][i]==0){
				boolean found=false;
				for (int j2 = 0; j2 < out[0].length; j2++) {
					if(x[j][j2]==1){
						found=true;
						break;
					}
				}
				if(!found)
					for (int k = 0; k < out.length; k++) {
						if(x[k][i]==1)
						{
							found=true;
							break;
						}
					}
				
				if(found)
					out[j][i]=1;
			}else out[j][i]=1;
			}
		}
		
		
		for (int i = 0; i < out.length; i++) {
			for (int j = 0; j < out[i].length; j++) {
			if(out[i][j]!=input[i][j])
				return false;
			}
		//	System.out.println();
		}
		
		return true;
	}
	
	
public static void main(String[] args) throws IOException {
	BufferedReader in =new BufferedReader(new InputStreamReader(System.in));
	StringTokenizer st=new StringTokenizer(in.readLine());
	int row=Integer.parseInt(st.nextToken());
	int col=Integer.parseInt(st.nextToken());
	input=new int[row][col];
	int [][] output=new int[row][col];
	for (int i = 0; i < row; i++) {
		String [] tmp=in.readLine().split(" ");
	for (int j = 0; j < tmp.length; j++) {
		input[i][j]=Integer.parseInt(tmp[j]);
	}
	}
	for (int i = 0; i < input.length; i++) {
	for (int j = 0; j < input[i].length; j++) {
		if(input[i][j]==0){
			for (int j2 = 0; j2 < output[i].length; j2++) {
				output[i][j2]=-1;
			}
		for (int j2 = 0; j2 < output.length; j2++) {
			output[j2][j]=-1;
		}
		}
	}
	}
//	boolean wrong=false;
	for (int i = 0; i < output.length; i++) {
		for (int j = 0; j < output[i].length; j++) {
			if(output[i][j]==-1)
				output[i][j]=0;
			else output[i][j]=1;
		}}
			
			//		if(output[i][j]==input[i][j])
//			continue;
////		else {
////			System.out.println(output[i][j]+" "+input[i][j]);
////			wrong=true;
////			break;
////		}
//	}
//		}
	if(!form(output))
	System.out.println("NO");
	else {
		System.out.println("YES");
		for (int i = 0; i < output.length; i++) {
			for (int j = 0; j < output[0].length; j++) {
				System.out.print(output[i][j]+" ");
			}
			System.out.println();
		}
	}
	
}
}