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.*;
import java.lang.*;
import java.io.*;
public class  a  {
    static final int mod = 1000000007; 
    static FastReader sc = new FastReader();  
    static PrintWriter out = new PrintWriter(System.out);
        
    public static void main (String[] args) throws java.lang.Exception {
        int n = sc.nextInt();
        int m = sc.nextInt();
        int arr[][] = new int[n][m];
        HashSet<Integer> rhs = new HashSet<>();
        HashSet<Integer> chs = new HashSet<>();
        for ( int i = 0 ; i < n; i++ ) {
            for ( int  j = 0 ; j < m; j++) {
                arr[i][j] = sc.nextInt();
                if (arr[i][j] == 0) {
                    rhs.add(i);
                    chs.add(j);
                }
            }
        }
        
        int a[][] = new int[n][m];
        boolean flag = true;
        for ( int i = 0 ; i < n && flag ; i++ ) {
            for ( int j = 0 ; j < m && flag; j++ ) {
                if (arr[i][j] == 1 && rhs.contains(i) && chs.contains(j) ) {
                    flag = false;
                }
                else if ( arr[i][j]  == 1 && rhs.contains(i) ) {
                    flag = false;
                    for ( int k = 0 ; k < n; k++) {
                        if (!rhs.contains(k)) {
                            a[k][j] = 1;
                            flag = true;
                            break;
                        }
                    }
                }
                else if ( arr[i][j] == 1 && chs.contains(j)) {
                    flag = false;
                    for ( int k = 0 ; k < m; k++) {
                        if(!chs.contains(k)) {
                            a[i][k] = 1;
                            flag = true;
                            break;
                        }
                    }
                }
                else if ( arr[i][j] == 1 ) {
                    flag = false;
                    for ( int k = 0 ; k < m; k++) {
                        if(!chs.contains(k)) {
                            a[i][k] = 1;
                            flag = true;
                            break;
                        }
                    }
                }
            }
        }
        if (!flag) {
            out.println("NO");
        }else {
            out.println("YES");
            for ( int i = 0 ; i < n; i++ ) {
                for ( int j = 0 ; j < m;  j++ ) {
                    out.print(a[i][j] +" ");
                }
                out.println();
            }
        }
        
        out.flush();        
    }
}
class FastReader{ 
     
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    }