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.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException{

		ContestScanner in = new ContestScanner();
		int m = in.nextInt();
		int n = in.nextInt();
		int[][] a = new int[m][n];
		int[] aline = new int[n];
		int[] acol = new int[m];
		long one = 0;
		for(int i=0; i<m; i++){
			for(int j=0; j<n; j++){
				int val = in.nextInt();
				acol[i] += val;
				aline[j]+= val;
				one += val;
			}
		}
		int line1num = 0;
		int col1num = 0;
		for(int i=0; i<m; i++){
			if(acol[i] == n) line1num++;
		}
		for(int i=0; i<n; i++){
			if(aline[i] == m) col1num++;
		}
		
		for(int i=0; i<m; i++){
			if(acol[i] != n && acol[i] != col1num){
				System.out.println("NO");
				return;
			}
		}
		for(int i=0; i<n; i++){
			if(aline[i] != m && aline[i] != line1num){
				System.out.println("NO");
				return;
			}
		}
		if(one > 0 && (line1num == 0 || col1num == 0)){
			System.out.println("NO");
			return;
		}
		
		System.out.println("YES");
		for(int i=0; i<m; i++){
			for(int j=0; j<n; j++){
				if(acol[i] == n && aline[j] == m){
					System.out.print(1);
					a[i][j] = 1;
				}else{
					System.out.print(0);
					a[i][j] = 0;
				}
				if(j != n-1) System.out.print(" ");
			}
			System.out.println();
		}
	}

}

class MyMath{
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}
//	public static long combi(int n, int k){
//		if(k > n/2){
//			k = n - k;
//		}
//		long res = 1;
//		for(int i=0; i<k; i++){
//			res *= n--;
//		}
//		while(k > 1){
//			res /= k--;
//		}
//		return res;
//	}
//	
//	public static long combiBig(int n, int k){
//		if(k > n/2){
//			k = n - k;
//		}
//		int[] a = new int[k];
//		int subK = k;
//		for(int i=0; i<k; i++){
//			a[i] = n--;
//		}
//		while(k > 1){
//			int oldK = k;
//			for(int i=0; i<subK; i++){
//				if(a[i]%k == 0){
//					a[i] /= k--;
//					break;
//				}
//			}
//			if(oldK == k){
//				int oldK2 = k;
//				for(int i=0; i<subK; i++){
//					if(oldK%a[i] == 0){
//						oldK /= a[i];
//						a[i] = 1;
//						if(oldK == 1){
//							k--;
//							break;
//						}
//					}
//				}
//				if(oldK2 == k){
//					// ���̂�����̓f�o�b�O�s���̂��߁A�������o�͂��o��ۏ؂��Ȃ�
//					k--;
//					long res = 1;
//					for(int i=0; i<subK; i++){
//						res *= a[i];
//					}
//					res /= oldK;
//					while(k > 1){
//						res /= k--;
//					}
//					return res;
//				}
//			}
//		}
//		long res = 1;
//		for(int i=0; i<subK; i++){
//			res *= a[i];
//		}
//		return res;
//	}
}

class MyCompA implements Comparator<int[]>{
	public int compare(int[] arg0, int[] arg1) {
		return arg0[0] - arg1[0];
	}
}

class MyCompB implements Comparator<int[]>{
	public int compare(int[] arg0, int[] arg1) {
		return arg0[1] - arg1[1];
	}
}

class ContestScanner{
	BufferedReader reader;
	String[] line;
	int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}