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.util.Scanner;


public class B486 {
	private int[][] input;
	private int[][] output;
	private int[][] OI;
	private int[] rowsAnd;
	private int[] colsAnd;
	private int rows;
	private int cols;
	private String op="No";
	private Boolean IpZero = true;
	private Boolean OpZero = true;
	
	public static void main(String[] args) {
		B486 obj = new B486();
		obj.init();
	}
	
	private void init() {
		Scanner sc = new Scanner(System.in);
		String size = sc.nextLine();
		int rows = Integer.parseInt(size.split(" ")[0]);
		int cols = Integer.parseInt(size.split(" ")[1]);
		this.rows = rows;
		this.cols = cols;
		rowsAnd = new int[rows];
		colsAnd = new int[cols];
		input = new int[rows][cols];
		output = new int[rows][cols];
		OI = new int[rows][cols];
		
		for(int i=0;i<rows;i++)
		{
			for(int j=0;j<cols;j++)
			{
				input[i][j] = sc.nextInt();
				if(input[i][j] == 1)
				{
					IpZero = false;
				}
			}
		}
		sc.close();
		
		for(int i=0;i<rows;i++)
		{
			int temp=1;
			for(int j=0;j<cols;j++)
			{
				temp = temp & input[i][j];
			}
			rowsAnd[i] = temp;
		}
		
		for(int i=0;i<cols;i++)
		{
			int temp=1;
			for(int j=0;j<rows;j++)
			{
				temp = temp & input[j][i];
			}
			colsAnd[i] = temp;
		}
		
		for(int i=0;i<rows;i++)
		{
			for(int j=0;j<cols;j++)
			{
				output[i][j] = rowsAnd[i] & colsAnd[j];
				if(output[i][j] == 1)
				{
					OpZero = false;
				}
			}
		}
		
		if(OpZero && IpZero)
		{
			System.out.println("YES");
			printMet(rows, cols);
		}
		else if(OpZero)
		{
			System.out.println("NO");
		}
		else
		{
			if(check(rows, cols))
			{
				System.out.println("YES");
				printMet(rows, cols);
			}
			else
			{
				System.out.println("NO");
			}
		}
	}
	
	private void printMet(int rows, int cols) {
		for(int i=0;i<rows;i++)
		{
			for(int j=0;j<cols;j++)
			{
				if(j!=0)
				{
					System.out.print(" ");
				}
				System.out.print(output[i][j]);
			}
			System.out.println();
		}
	}
	
	private Boolean check(int rows, int cols) {
		Boolean flag = true;
		for(int i=0;i<rows;i++) 
		{
			for(int j=0;j<cols;j++)
			{
				if(output[i][j] == 1)
				{
					buildOI(i, j);
				}
			}
		}
		
		for(int i=0;i<rows;i++)
		{
			for(int j=0;j<cols;j++)
			{
				if(input[i][j] != OI[i][j])
				{
					flag=false;
					break;
				}
			}
		}
		
		return flag;
	}
	
	private void buildOI(int i, int j) {
		for(int r=0;r<cols;r++)
		{
			OI[i][r] = 1;
		}
		for(int r=0;r<rows;r++)
		{
			OI[r][j] = 1;
		}
	}
}