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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class ORInMatrix {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(bf.readLine());
        int r = Integer.parseInt(st.nextToken());
        int c = Integer.parseInt(st.nextToken());
        int count = 0;
        int [][] a = new int[r][c];
        int [][] b = new int [r][c];
        for (int i = 0; i < a.length; i++) {
            st = new StringTokenizer(bf.readLine());
            for (int j = 0; j < a[i].length; j++) {
                a[i][j] = Integer.parseInt(st.nextToken());
                if(a[i][j] == 1)
                    count++;
                b[i][j] = -1;
            }
        }

        
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                for (int k = 0; k < b.length; k++) {
                    for (int l = 0; l < b[k].length; l++) {
                        if((k==i || l == j) && a[i][j] == 0){
                            b[k][l] = 0 ;
                        }
                        else if((k==i || l == j) && a[i][j] == 1 && b[k][l]==-1){
                            b[k][l] = -2 ;
                        }
                    }
                }
            }
        }
        boolean found = false ;
        boolean print = false ;
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) { 
                found = false ;
                for (int k = 0; k < b.length; k++) {    
                    for (int l = 0; l < b[k].length; l++) {
                        
                        if((k==i || l == j) && a[i][j] == 1 && b[k][l]==-2){
                            found = true ;
                        }
                    }
                    
                }if(!found && a[i][j] == 1 && count >0){
                    System.out.println("NO");
                    print = true ;
                    break;
                }
            }if(print)
                break;
            else
                found = false ;
        }
        if(!print){
            System.out.println("YES");
            for (int i = 0; i < b.length; i++) {
                for (int j = 0; j < b[i].length; j++) {
                    if(b[i][j] == -2)
                        System.out.print(1+" ");
                    else
                        System.out.print(b[i][j]+" ");
                }
                System.out.println();
            }
        }
    }
}