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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

public class zizo {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int m = sc.nextInt(), n = sc.nextInt();
		int[][] mat = new int[m][n], ans = new int[m][n];
		boolean[][] safe = new boolean[m][n];
		for(int i = 0; i < m; i++)
			for(int j = 0; j < n; j++)
				mat[i][j] = sc.nextInt();
		for(int i = 0; i < m; i++) {
			for(int j = 0; j < n; j++) {
				if(mat[i][j] == 0) {
					safe[i][j] = true;
					continue;
				}
				safe[i][j] = safe[i][j] ? true : check(i, j, mat);
				if(check(i, j, mat)) {
					makeSafe(i, j, safe);
					ans[i][j] = 1;
				}
			}
		}
		boolean mistake = true;
		for(int i = 0; i < m; i++)
			for(int j = 0; j < n; j++)
				mistake&=safe[i][j];
		if(!mistake)
			out.println("NO");
		else {
			out.println("YES");
			for(int i = 0; i < m; i++) {
				for(int j = 0; j < n; j++)
					out.print(ans[i][j] + (j == n - 1 ? "" : " "));
				out.println();
			}
		}
		out.flush();
		out.close();
	}

	public static boolean check(int r, int c, int[][] mat) {
		for (int i = 0; i < mat[0].length; i++)
			if (mat[r][i] == 0)
				return false;
		for (int i = 0; i < mat.length; i++)
			if (mat[i][c] == 0)
				return false;
		return true;
	}

	public static void makeSafe(int r, int c, boolean[][] safe) {
		for (int i = 0; i < safe[0].length; i++)
			safe[r][i] = true;
		for (int i = 0; i < safe.length; i++)
			safe[i][c] = true;
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}
}