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

public class SolutionB {
   BufferedReader in;
   StringTokenizer str;
   PrintWriter out;
   String SK;
 
   String next() throws IOException {
      while ((str == null) || (!str.hasMoreTokens())) {
         SK = in.readLine();
         if (SK == null)
              return null;
         str = new StringTokenizer(SK);
      }
      return str.nextToken();
   }
   int nextInt() throws IOException {
      return Integer.parseInt(next());
   }
   double nextDouble() throws IOException {
      return Double.parseDouble(next());
   }
   String nexts()throws IOException {
      return in.readLine();
   }
   long nextLong() throws IOException {
      return Long.parseLong(next());
   }
   char[] charArray() throws IOException{
      return next().toCharArray();
   }
   public static void main(String[] args) throws IOException {
      new SolutionB().run();
   }
   void run() throws IOException {
      in = new BufferedReader(new InputStreamReader(System.in));
      out = new PrintWriter(System.out);
      solve();
      out.close();
   }
   void solve() throws IOException {
      int n = nextInt();
      int m = nextInt();
      int ar[][]=new int[n][m];
      for (int i = 0; i < n; i++) {
         for (int j = 0; j < m; j++) {
            ar[i][j]=nextInt();
         }
      }
      int br[][]=new int[n][m];
      for (int i = 0; i < n; i++) {
         for (int j = 0; j < m; j++) {
            br[i][j]=-1;
         }
      }
      
      for (int i = 0; i < n; i++) {
         for (int j = 0; j < m; j++) {
            if(ar[i][j]==0){
               go(br, i, j, n, m);
            }
         }
      }
      
      
      for (int i = 0; i < n; i++) {
         for (int j = 0; j < m; j++) {
            if(ar[i][j]==1){
               if(!check(br, i,j,n,m)){
                  out.println("NO");
                  return;
               }
            }
         }
      }
      out.println("YES");
      for (int i = 0; i < n; i++) {
         for (int j = 0; j < m; j++) {
            if(br[i][j]==-1)
               out.print(1+" ");
            else out.print(0 + " ");
         }
         out.println("");
      }



   }
   boolean check(int a[][], int i, int j, int n, int m){
      for (int k = 0; k < n; k++) {
         if(a[k][j]==-1){
            return true;
         }
      }
      for (int k = 0; k < m; k++) {
         if(a[i][k]==-1){
            return true;
         }
      }
      return false;
   }
   void go(int ar[][], int i, int j, int n, int m){
      for (int k = 0; k < m; k++) {
         ar[i][k]=0;
      }
      for (int k = 0; k < n; k++) {
         ar[k][j]=0;
      }
      
   }

}