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

public class B486 {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int rows = input.nextInt();
        int columns = input.nextInt();
        int[][] B = new int[rows][columns];
        int[][] A = new int[rows][columns];        
        for (int row=0; row<rows; row++) {
            for (int column=0; column<columns; column++) {
                A[row][column] = 1;
                B[row][column] = input.nextInt();
            }
        }
        for (int row=0; row<rows; row++) {
            for (int column=0; column<columns; column++) {
                if (B[row][column] == 0) {
                    for (int r=0; r<rows; r++) {
                        A[r][column] = 0;
                    }
                    for (int c=0; c<columns; c++) {
                        A[row][c] = 0;
                    }
                }
            }
        }
        boolean ok = true;
        for (int row=0; row<rows; row++) {
            for (int column=0; column<columns; column++) {
                if (B[row][column] == 1) {
                    boolean found = false;
                    for (int r=0; r<rows; r++) {
                        if (A[r][column] == 1) {
                            found = true;
                        }
                    }
                    for (int c=0; c<columns; c++) {
                        if (A[row][c] == 1) {
                            found = true;
                        }
                    }
                    if (!found) {
                        ok = false;
                    }
                }
            }
        }
        if (ok) {
            System.out.println("YES");
            StringBuilder output = new StringBuilder();
            for (int row=0; row<rows; row++) {
                for (int column=0; column<columns; column++) {
                    if (column != 0) {
                        output.append(" ");
                    }
                    output.append(A[row][column]);
                }
                output.append('\n');
            }
            System.out.print(output);
        } else {
            System.out.println("NO");
        }
    }

}