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.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;

public class SolB {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskSolver solver = new TaskSolver();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskSolver {

    int m;
    int n;
    int[][] mtx;
    boolean[] row;
    boolean[] col;
    int i,j;

    public void solve(int testNumber, InputReader in, OutputWriter out) {
        m = in.nextInt();
        n = in.nextInt();

        mtx = new int[m][n];
        row = new boolean[m];
        col = new boolean[n];

        for (i = 0; i < m; ++i) {
            row[i] = true;
            for (j = 0; j < n; ++j) {
                mtx[i][j] = in.nextInt();
                if(mtx[i][j] == 0)
                    row[i] = false;
            }
        }

        for (j = 0; j < n; ++j) {
            col[j] = true;
            for (i = 0; i < m; ++i) {
                if(mtx[i][j] == 0)
                    col[j] = false;
            }
        }

        int[][] outMtx = new int[m][n];
        boolean nonZero = false;
        for (i = 0; i < m; ++i) {
            for (j = 0; j < n; ++j) {
                //check 4 directions
                if(getVal(i,j) == 1){
                    nonZero = true;
                    if(row[i] || col[j]){
                        if(row[i] && col[j]){
                            outMtx[i][j] = 1;
                        }
                    }else{
                        out.println("NO");
                        return;
                    }
                }
            }
        }

        boolean hasRow = false;
        boolean hasCol = false;
        if(nonZero){
            for (i = 0; i < m; ++i) {
                if(row[i]){
                    hasRow = true;
                    break;
                }
            }
            for (i = 0; i < n; ++i) {
                if(col[i]){
                    hasCol = true;
                    break;
                }
            }

            if(!hasRow || !hasCol){
                out.println("NO");
                return;
            }

        }

        out.println("YES");
        for (i = 0; i < m; ++i) {
            for (j = 0; j < n; ++j) {
                out.print(outMtx[i][j] + " ");
            }
            out.println();
        }



        
    }

    private int getVal(int i, int j){
        if(i < 0 || j < 0 || i >= m || j >= n)
            return 1;
        return mtx[i][j];
    }

}

/*
    int in.nextInt()
    String in.nextString()

    out.print(n + " ") //must be " " which is a String object.
    out.close()
*/
class InputReader {
    InputStream stream;
    byte[] buf = new byte[1024];
    int curChar, numChars;

    public InputReader(InputStream stream) {
        this.stream = stream;
    }

    private int read() {

        if (numChars == -1)
            throw new InputMismatchException();
        //buffer wraps around here. Hence the buf array size does not matter.
        /*
        if the buffer size is enough, i.e 1024. InputStream load at most 1024 bytes(if necessary)
        into buffer. read() returns 1 byte every time. After the first read, it only needs to
        return corresponding byte in the buf every time it is called. it does not have to call
        input stream to read again.
        Only if the bug has run out does InputReader has to call stream.read(buf) to reload the
        buf.
        */
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }


    public int nextInt() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public String nextString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuffer res = new StringBuffer();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }

    private boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

}

class OutputWriter {

    private final PrintWriter writer;

    public OutputWriter(OutputStream outputStream) {
        writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }

    public OutputWriter(Writer writer) {
        this.writer = new PrintWriter(writer);
    }

    public void print(Object... objects) {
        for (int i = 0; i < objects.length; i++) {
            if (i != 0)
                writer.print(' ');
            writer.print(objects[i]);
        }
    }

    public void println(Object... objects){
        print(objects);
        print("\n");
    }

    public void close() {
        writer.close();
    }

}