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.awt.*;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;

import static java.lang.Math.*;

public class Solution implements Runnable {
    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");
    String delim = "";

    String readString() throws IOException {
        try {
            while (!tok.hasMoreTokens()) {
                tok = new StringTokenizer(in.readLine());
            }
            return tok.nextToken();
        } catch (Exception e) {
            return null;
        }
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    Point readPoint() throws IOException {
        return new Point(readInt(), readInt());
    }

    // ----------------------------------

    public class Pair<T1, T2> {
        public T1 x1;
        public T2 x2;

        public Pair() {
        };

        public Pair(T1 x1, T2 x2) {
            this.x1 = x1;
            this.x2 = x2;
        }

        public String toString() {
            return x1 + ":" + x2;
        }
    }

    public class Three {
        public int x, y, z;

        public Three() {
        }

        public Three(int a, int b, int c) {
            x = a;
            y = b;
            z = c;
        }

        public String toString() {
            return x + ":" + y + ":" + z;
        }
    }

    // ----------------------------------------
    
    double willBe(double r1,int c1,int est,double r){
        int estimated = est;
        int need = estimated - c1;
        double estrating = c1*r1 + need*r;
        estrating /= estimated;
        return estrating;   
    }
    
    void solve() throws NumberFormatException, IOException {
        int n = readInt();
        int m = readInt();
        int[][] b = new int[n][m];
        for (int i=0;i<n;i++){
            for (int j=0;j<m;j++){
                b[i][j] = readInt();
            }
        }
        boolean[][] zero = new boolean[n][m];
        for (int i=0;i<n;i++){
            for (int j=0;j<m;j++){
                if (b[i][j] == 0){
                    for (int ii=0;ii<n;ii++){
                        zero[ii][j] = true;                     
                    }
                    for (int jj =0;jj<m;jj++){
                        zero[i][jj] = true;
                    }
                }
            }
        }
        
        for (int i=0;i<n;i++){
            for (int j=0;j<m;j++){
                if (b[i][j] == 1){
                    boolean odin = false;
                    for (int ii=0;ii<n;ii++){
                        if (!zero[ii][j]) {
                            odin = true;
                            break;
                        }
                    }
                    for (int jj =0;jj<m;jj++){
                        if (!zero[i][jj]){
                            odin = true;
                            break;
                        }
                    }
                    if (!odin){
                        out.println("NO");
                        return;
                    }
                }
            }
        }
        out.println("YES");
        for (int i=0;i<n;i++){
            for (int j=0;j<m;j++){
                out.print((zero[i][j] ? '0' : '1')+" ");                
            }
            out.println();
        }
        
        
        
    }

    // ----------------------------------------
    public static void main(String[] args) {
        new Thread(null, new Solution(), "", 256 * (1L << 20)).start();
    }

    public void run() {
        try {
            timeBegin = System.currentTimeMillis();

            try {
                if (ONLINE_JUDGE) {
                    in = new BufferedReader(new InputStreamReader(System.in));
                    out = new PrintWriter(System.out);
                } else {
                    in = new BufferedReader(new FileReader("input.txt"));
                    out = new PrintWriter("output.txt");
                }
            } catch (Throwable e) {
                in = new BufferedReader(new InputStreamReader(System.in));
                out = new PrintWriter(System.out);
            }
            solve();
            out.close();

            timeEnd = System.currentTimeMillis();
            if (!ONLINE_JUDGE)
                System.err.println("Time = " + (timeEnd - timeBegin));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }

    long timeBegin, timeEnd;
}