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:

/**
 * @author egaeus
 * @mail sebegaeusprogram@gmail.com
 * @veredict Not sended
 * @url <https://codeforces.com/problemset/problem/486/B>
 * @category biginteger
 * @date 6/06/2020
 **/

import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

import static java.lang.Integer.*;
import static java.lang.Math.*;

public class CF486B {
    public static void main(String args[]) throws Throwable {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        for (String ln; (ln = in.readLine()) != null && !ln.equals(""); ) {
            StringTokenizer st = new StringTokenizer(ln);
            int N = parseInt(st.nextToken()), M = parseInt(st.nextToken());
            int[] rows = new int[N];
            int[] cols = new int[M];
            int[][] mat = new int[N][M];
            for (int i = 0; i < N; i++) {
                st = new StringTokenizer(in.readLine());
                for (int j = 0; j < M; j++) {
                    int v = parseInt(st.nextToken());
                    rows[i] += v;
                    cols[j] += v;
                    mat[i][j] = v;
                }
            }
            int[][] solution = new int[N][M];
            boolean[] row = new boolean[N];
            boolean[] col = new boolean[M];
            for (int i = 0; i < N; i++)
                for (int j = 0; j < M; j++) {
                    if (rows[i] == M && cols[j] == N) {
                        solution[i][j] = 1;
                        row[i] = true;
                        col[j] = true;
                    }
                }
            boolean ws = true;
            for (int i = 0; i < N; i++)
                for (int j = 0; j < M; j++) {
                    if (mat[i][j] == 1 && !row[i] && !col[j])
                        ws = false;
                    if (mat[i][j] == 0 && (row[i] || col[j]))
                        ws = false;
                }
            if (ws) {
                System.out.println("YES");
                for (int[] a : solution)
                    System.out.println(IntStream.of(a).mapToObj(c -> c + "").collect(Collectors.joining(" ")));
            } else System.out.println("NO");
        }
    }
}