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.*;
import java.math.BigInteger;
import java.util.*;






public class Main {
    static Scanner input = new Scanner(System.in);
    final static double EPS = 1e-8;
    //static boolean[][] vis;
    static ArrayList<ArrayList<Long>> graph;
    static boolean[] vis;
    static char grid[][];
    static int n; 
    static int m; 
    static int x; 
    static int y;
    static ArrayList<Integer> lengths;
    static int[] length;
    static Stack<Integer> s = new Stack<>();
    static ArrayList<Integer> topo;
    static int count;
    static int arr[];
    static int arrx[];
    static int arrh[];
    static Stack[] arrS;
    static char[] charArr;
    static int[] d;
    static int[] d4x = {-1, 1, 0, 0};
    static int[] d4y = {0, 0, -1, 1};
    static int[][] a;
    static int[][] b;
    
    public static class Pair implements Comparable<Pair> {
    	int id;
    	int m;
		public Pair(int nextInt, int nextInt2) {
			id = nextInt;
			m = nextInt2;
		}
		@Override
		public int compareTo(Pair o) {
			if (m > o.m)
				return -1;
			return 0;
		}
    	
		@Override
		public String toString() {
			return id + " " + m;
		}
    	
    }
	
	public static int isB(String word) {
		if (word.charAt(0) != '1')
			return -1;
		
		int n = word.length();
		
		for (int i = 1; i < n; i++)
			if (word.charAt(i) != '0')
				return -1;
		
		return n - 1;		
	}
	
	
	public static int calcRow(int row) {
		for (int j = 0; j < m; j++)
			if (b[row][j] == 0)
				return 0;
		
		return 1;
	}
    
	public static int calcCol(int col) {
		for (int i = 0; i < n; i++)
			if (b[i][col] == 0)
				return 0;
		
		return 1;
	}
    
	public static void main(String[] args) {
	
		n = input.nextInt();
		m = input.nextInt();
		
		a = new int[n][m];
		
		b = new int[n][m];
		boolean allZeros = true;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++) {
				b[i][j] = input.nextInt();
				if (b[i][j] == 1)
					allZeros = false;
			}
		
			
		
		int row[] = new int[n];
		int col[] = new int[m];
		
		Arrays.fill(row, -1);
		Arrays.fill(col, -1);
		
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++) {
				if (b[i][j] == 1) {
					int rowVal = row[i];
					int colVal = col[j];
					
					if (rowVal == -1)
						row[i] = rowVal = calcRow(i);
					if (colVal == -1)
						col[j] = colVal = calcCol(j);
					
					if (rowVal == 0 && colVal == 0) {
						System.out.println("NO");
						return;
					}
					else if (rowVal == 1 && colVal == 1) {
						a[i][j] = 1;
						/*if (i == n - 1)
							lastRow = true;
						if (i == m - 1)
							lastCol = true;*/
					}
					
					
				}
			}	
		/*
		int orx = 0;
		int ory = 0;
		
		for (int i = 0; i < n; i++)
			if (row[i] == 1)
				orx++;
		
		for (int i = 0; i < m; i++)
			if (col[i] == 1)
				ory++;
		
		if (orx != ory || orx != ory)*/
		int count = 0;
		for (int i = 0; i < n; i++) 
			for (int j = 0; j < m; j++)
				if (a[i][j] == 1)
					count++;
		if (!allZeros && count == 0) {
			System.out.println("NO");
			return;
		} 
			
		
		
		System.out.println("YES");
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++)
				System.out.print(a[i][j] + " ");
			System.out.println();	
		}
		
		
		
	}
	
	
	
	
	

}