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.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import static java.lang.reflect.Array.set;
import java.math.BigInteger;
import java.net.InetAddress;
import static java.time.Clock.system;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;
import javax.swing.tree.TreeNode;
 








 
public class Main {
 
  public static boolean search(int i,int j){
      for (int k = 0; k < row; k++) 
          if(ans[k][j]==1)return true;
      
      for (int k = 0; k < col; k++) 
          if(ans[i][k]==1)return true;
      
  
  
  
  return false;}
 
static int ans[][],ar[][],row,col;
 static PrintWriter pw=new PrintWriter(System.out);
    public static void main(String[] args) throws IOException {
         Reader.init(System.in);
               row=Reader.nextInt();
               col=Reader.nextInt();
              ar=new int [row][col];
               ans=new int[row][col];
              
              for (int i = 0; i < row; i++) 
                Arrays.fill(ans[i], -1);
              
       
              
              
              for (int i = 0; i < row; i++) 
                  for (int j = 0; j < col; j++) 
                      ar[i][j]=Reader.nextInt();
              
              
              for (int i = 0; i < row; i++) {
                  for (int j = 0; j < col; j++) {
                      if(ar[i][j]==0)
                      {
                      Arrays.fill(ans[i], 0);
                      
                          for (int k = 0; k < row; k++) {
                              ans[k][j]=0;
                          }
                      
                      
                      
                      
                      }
                  }
        }
             
              
              for (int i = 0; i < row; i++) 
                  for (int j = 0; j < col; j++) 
                      if(ans[i][j]==-1)
                      ans[i][j]=1;
                      
            
              
              for (int i = 0; i < row; i++) {
                  for (int j = 0; j < col; j++) {
                      if(ar[i][j]==1)
                          if(!search(i,j))
                          {pw.println("NO");
                          pw.close();
                          return;}
                  }
        }
                      
              pw.println("YES");
              for (int i = 0; i < row; i++) {
                  for (int j = 0; j < col; j++) {
                      pw.print(ans[i][j]+" ");
                  }
                  pw.println();
        }
                  
        
              
              
              
              
                  
        
            pw.close();
            
        }}
 
 
class Reader {
 
        static BufferedReader reader;
        static StringTokenizer tokenizer;
 
        public static int pars(String x) {
            int num = 0;
            int i = 0;
            if (x.charAt(0) == '-') {
                i = 1;
            }
            for (; i < x.length(); i++) {
                num = num * 10 + (x.charAt(i) - '0');
            }
 
            if (x.charAt(0) == '-') {
                return -num;
            }
 
            return num;
        }
 
        static void init(InputStream input) {
            reader = new BufferedReader(
                    new InputStreamReader(input));
            tokenizer = new StringTokenizer("");
        }
 
        static void init(FileReader input) {
            reader = new BufferedReader(input);
            tokenizer = new StringTokenizer("");
        }
 
        static String next() throws IOException {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(
                        reader.readLine());
            }
            return tokenizer.nextToken();
        }
 
        static int nextInt() throws IOException {
            return pars(next());
        }
 
        static long nextLong() throws IOException {
            return Long.parseLong(next());
        }
 
        static double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }