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.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.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class TaskB {

	static int n, l, r, x;
	static int[] arr;
	static int ans;

	static void bf(int idx, int min, int max, long sum) {
		if (idx == n) {
			if (sum <= r && sum >= l && max - min >= x)
				ans++;
		} else {
			bf(idx + 1, Math.min(min, arr[idx]), Math.max(max, arr[idx]), sum + arr[idx]);
			bf(idx + 1, min, max, sum);
		}

	}

	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);

		n = sc.nextInt();
		int m = sc.nextInt();

		int[][] b = new int[n][m];
		int[][] a = new int[n][m];
		for (int i = 0; i < n; i++) {
			Arrays.fill(a[i], 1);
			for (int j = 0; j < m; j++)
				b[i][j] = sc.nextInt();
		}

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (b[i][j] == 0) {
					for (int k = 0; k < m; k++)
						a[i][k] = 0;
					for (int k = 0; k < n; k++)
						a[k][j] = 0;
				}
			}
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (b[i][j] == 1) {
					boolean f1 = false;
					for (int k = 0; k < m; k++)
						if (a[i][k] == 1)
							f1 = true;
					for (int k = 0; k < n; k++)
						if (a[k][j] == 1)
							f1 = true;
					if (!f1) {
						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();
		}

		pw.close();
	}

	static class Pair {

		long total;
		int diff;

		public Pair(long total, int diff) {
			this.total = total;
			this.diff = diff;
		}

		public String toString() {
			return total + " " + diff;
		}

	}

	static class Pair2 implements Comparable<Pair2> {

		int x, y;
		long i;

		public Pair2(int x, int y, long i) {
			this.x = x;
			this.y = y;
			this.i = i;

		}

		public int compareTo(Pair2 o) {
			if (x == o.x)
				if (y == o.y)
					return Long.compare(i, o.i);
				else
					return y - o.y;
			return x - o.x;
		}

		public String toString() {
			return x + " " + y + " " + i;
		}

	}

	static class Edge implements Comparable<Edge> {
		int node, cost;

		Edge(int a, int b) {
			node = a;
			cost = b;
		}

		public int compareTo(Edge e) {
			return cost - e.cost;
		}
	}

	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 {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

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

	}

}