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

public class B
{

	FastScanner in;
	PrintWriter out;
	int i = 0, j = 0;


	void solve() {
		/**************START**************/
		int r = in.nextInt(), c = in.nextInt();
		boolean[][] matrix = new boolean[r][c];
		boolean[] rows = new boolean[r], cols = new boolean[c];
		Arrays.fill(rows, true);
		Arrays.fill(cols, true);
		for (i = 0; i < r; i++)
		{
			for (j = 0; j < c; j++)
			{
				matrix[i][j] = (in.next().charAt(0) == '1');
				if (!matrix[i][j])
				{
					rows[i] = false;
					cols[j] = false;
				}
			}
		}
		int fullR = 0, fullC = 0;
		for (i = 0; i < r; i++)
		{
			if (rows[i])
				fullR++;
		}
		for (i = 0; i < c; i++)
		{
			if (cols[i])
				fullC++;
		}
		if ((fullR > 0 && fullC == 0) || (fullR == 0 && fullC > 0))
		{
			out.println("NO");
			return;
		}
		StringBuilder sb = new StringBuilder();
		for (i = 0; i < r; i++)
		{
			for (j = 0; j < c; j++)
			{
				if (matrix[i][j])
				{
					if (rows[i] && cols[j])
						sb.append("1 ");
					else if (rows[i] || cols[j])
						sb.append("0 ");
					else
					{
						out.println("NO");
						return;
					}
				}
				else
				{
					sb.append("0 ");
				}
			}
			sb.append("\n");
		}
		out.println("YES");
		out.print(sb.toString());













		/***************END***************/
	}

	public static void main(String[] args) {
		new B().runIO();
	}

	void runIO() {
		in = new FastScanner(System.in);
		out = new PrintWriter(System.out);

		solve();

		out.close();
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(File f) {
			try {
				br = new BufferedReader(new FileReader(f));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		public FastScanner(InputStream f) {
			br = new BufferedReader(new InputStreamReader(f));
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return null;
				st = new StringTokenizer(s);
			}
			return st.nextToken();
		}

		//This will empty out the current line (if non-empty) and return the next line down. If the next line is empty, will return the empty string.
		String nextLine() {
				st = null;
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				return s;
		}

		boolean hasMoreTokens() {
			while (st == null || !st.hasMoreTokens()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return false;
				st = new StringTokenizer(s);
			}
			return true;
		}

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

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

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