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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.concurrent.LinkedBlockingDeque;

import javax.swing.border.Border;

public class a {

	public static long mod = (long) Math.pow(10, 9) + 7;

	private static class node implements Comparable<node> {
		ArrayList<Integer> a;
		int val;

		node(ArrayList<Integer> a, int val) {
			this.a = a;
			this.val = val;

		}

		@Override
		public int compareTo(node o) {
			if (o.val > val)
				return 1;
			else
				return -1;
		}

	}

	public static int ch(long y) {
		int r = Long.bitCount(y);
		return r;
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder qq = new StringBuilder();
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		String y[] = in.readLine().split(" ");
		// long n = Integer.parseInt(y[0]);
		int row = Integer.parseInt(y[0]);
		int col = Integer.parseInt(y[1]);
		int a[][] = new int[row][col];
		int arr[][] = new int[row][col];
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				a[i][j] = -1;
			}
		}

		for (int i = 0; i < row; i++) {
			y = in.readLine().split(" ");
			for (int j = 0; j < col; j++) {
				arr[i][j] = Integer.parseInt(y[j]);

				if (arr[i][j] == 0) {
					for (int j2 = 0; j2 < col; j2++) {
						a[i][j2] = 0;
					}
					for (int j2 = 0; j2 < row; j2++) {
						a[j2][j] = 0;
					}
				}
			}
		}

		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				if (a[i][j] == -1)
					a[i][j] = 1;
			}
		}

		int r[] = new int[row];
		int c[] = new int[col];

		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				r[i] |= a[i][j];
			}
		}

		for (int i = 0; i < col; i++) {
			for (int j = 0; j < row; j++) {
				c[i] |= a[j][i];
			}
		}

		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				if ((r[i] | c[j]) != arr[i][j]) {
					System.out.println("NO");
					return;
				}
			}
		}

		out.println("YES");
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				out.print(a[i][j] + " ");
			}
			out.print("\n");
		}

		out.close();

	}
}