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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
public   class Main {
    static class Reader
    {
    BufferedReader r;
    StringTokenizer str;
    Reader()
    {
    r=new BufferedReader(new InputStreamReader(System.in));
    }
    Reader(String fileName) throws FileNotFoundException
    {
    r=new BufferedReader(new FileReader(fileName));
    }
    public String getNextToken() throws IOException
    {
    if(str==null||!str.hasMoreTokens())
    {
    str=new StringTokenizer(r.readLine());
    }
    return str.nextToken();
    }
    public int nextInt() throws IOException
    {
    return Integer.parseInt(getNextToken());
    }
    public long nextLong() throws IOException
    {
    return Long.parseLong(getNextToken());
    }
    public Double nextDouble() throws IOException
    {
    return Double.parseDouble(getNextToken());
    }
    public String nextString() throws IOException
    {
    return getNextToken();
    }
    public int[] intArray(int n) throws IOException
    {
        int a[]=new int[n];
        for(int i=0;i<n;i++)
            a[i]=nextInt();
        
        return a;
        
    }
    public long[] longArray(int n) throws IOException
    {
        long a[]=new long[n];
        for(int i=0;i<n;i++)
            a[i]=nextLong();
        
        return a;
        
    }
    public String[] stringArray(int n) throws IOException
    {
        String a[]=new String[n];
        for(int i=0;i<n;i++)
            a[i]=nextString();
        
        return a;
        
    }
    public int gcd(int a, int b) {
if(b == 0){
return a;
}
return gcd(b, a%b);
}
    }
 
    public static void main(String args[]) throws IOException{
 
       Reader r=new Reader();
       PrintWriter pr=new PrintWriter(System.out,false);
 int n=r.nextInt();
 int m=r.nextInt();
 boolean a[][]=new boolean[n][m];
 boolean b[][]=new boolean[n][m];
 for(int i=0;i<n;i++)
 {
     Arrays.fill(b[i],true);
     
 }
 for(int i=0;i<n;i++)
 {
     for(int j=0;j<m;j++)
         if(r.nextInt()==1)
             a[i][j]=true;
         else
             a[i][j]=false;
     
     
 }
 
 
 
 for(int i=0;i<n;i++)
 {
     for(int j=0;j<m;j++)
     {
         if(!a[i][j])
         {
             for(int k=0;k<m;k++)
             {
                 
                 b[i][k]=false;
                 
             }
             for(int k=0;k<n;k++)
                 b[k][j]=false;
             
         }
         
         
     }
     
 }
 
 out:
 for(int i=0;i<n;i++)
 {
     for(int j=0;j<m;j++)
     {
         boolean temp=false;
         
         for(int k=0;k<m;k++)
         {
             temp=temp||b[i][k];
             
             
         }
         for(int k=0;k<n;k++)
         {
             temp=temp||b[k][j];
             
         }
         
         if(temp!=a[i][j])
         {
             pr.println("NO");
             
             pr.flush();
             pr.close();
             return;
         }
         
     }
     
     
 }
 pr.println("YES");
 for(int i=0;i<n;i++)
 {
     for(int j=0;j<m;j++)
     {
         if(b[i][j])
         pr.print("1 ");
         else
             pr.print("0 ");
         
     }
     pr.println();
 }
        

 
pr.flush();
pr.close();
    }
}