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

/**
 * Created by liverliu on 14/11/17.
 */
public class Main {

    public static int[][] mtx = new int[105][105];
    public static int[][] ans = new int[105][105];

    public static void main(String args[]) {

        Scanner scan = new Scanner(new BufferedInputStream(System.in));
        while(scan.hasNext()) {

            int n = scan.nextInt(), m = scan.nextInt();
            for(int i=0; i<n;i++) {
                for(int j=0;j<m;j++) {
                    mtx[i][j] = scan.nextInt();
                    ans[i][j] = -1;
                }
            }

            for(int i=0;i<n;i++) {
                for(int j=0;j<m;j++) {
                    if(mtx[i][j]==0) {
                        for(int k=0;k<m;k++) {
                            ans[i][k] = 0;
                        }
                        for(int k=0;k<n;k++) {
                            ans[k][j] = 0;
                        }
                    }
                }
            }
            boolean flag = true;
            for(int i=0;i<n;i++) {
                for(int j=0;j<m;j++) {
                    if(mtx[i][j]==1) {
                        boolean find = false;
                        for(int k=0;k<m;k++) {
                            if(ans[i][k]==-1){
                                find = true;
                                ans[i][k]=1;
                            }
                            if(ans[i][k]==1) {
                                find = true;
                            }
                        }
                        for(int k=0;k<n;k++) {
                            if(ans[k][j]==-1){
                                find = true;
                                ans[k][j]=1;
                            }
                            if(ans[k][j]==1) {
                                find = true;
                            }
                        }
                        if(!find) {
                            flag = false;
                        }
                    }
                }
            }
            if(!flag) {
                System.out.println("NO");
            } else {
                System.out.println("YES");
                for(int i=0;i<n;i++) {
                    for(int j=0;j<m;j++) {
                        System.out.print(ans[i][j]);
                        if(j < m-1) {
                            System.out.print(' ');
                        } else {
                            System.out.println();
                        }
                    }
                }
            }
        }
    }
}