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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.util.Map;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ORinMatrix solver = new ORinMatrix();
        solver.solve(1, in, out);
        out.close();
    }

    static class ORinMatrix {
        boolean mustRow = false;
        boolean mustCol = false;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int m = in.nextInt();
            int n = in.nextInt();
            ORinMatrix.State[] rows = new ORinMatrix.State[m];
            ORinMatrix.State[] cols = new ORinMatrix.State[n];
            Map<Integer, List<Integer>> rowToColumns = new HashMap<>();
            Map<Integer, List<Integer>> colToRows = new HashMap<>();
            boolean result = true;
            for (int i = 0; i < m; ++i) {
                for (int j = 0; j < n; ++j) {
                    int x = in.nextInt();
                    if (x == 0) {
                        if (rows[i] == ORinMatrix.State.MUST_ONE || cols[j] == ORinMatrix.State.MUST_ONE) {
                            result = false;
                        } else {
                            rows[i] = ORinMatrix.State.MUST_ZERO;
                            cols[j] = ORinMatrix.State.MUST_ZERO;
                            result &= adjustCols(rowToColumns, i, cols);
                            result &= adjustRows(colToRows, j, rows);
                        }
                    } else if (x == 1) {
                        if (rows[i] == ORinMatrix.State.MUST_ZERO && cols[j] == ORinMatrix.State.MUST_ZERO) {
                            result = false;
                        } else if (rows[i] == ORinMatrix.State.MUST_ZERO) {
                            cols[j] = ORinMatrix.State.MUST_ONE;
                            mustCol = true;
                        } else if (cols[j] == ORinMatrix.State.MUST_ZERO) {
                            rows[i] = ORinMatrix.State.MUST_ONE;
                            mustRow = true;
                        } else {
                            if (!rowToColumns.containsKey(i)) {
                                rowToColumns.put(i, new ArrayList<>());
                            }
                            if (!colToRows.containsKey(j)) {
                                colToRows.put(j, new ArrayList<>());
                            }
                            rows[i] = ORinMatrix.State.COULD_ONE;
                            cols[j] = ORinMatrix.State.COULD_ONE;
                            rowToColumns.get(i).add(j);
                            colToRows.get(j).add(i);
                        }
                    }
                }
            }
            boolean allRowsZeros = true;
            for (int i = 0; i < m; ++i) {
                if (rows[i] != ORinMatrix.State.MUST_ZERO) {
                    allRowsZeros = false;
                }
            }
            if (allRowsZeros && mustCol) {
                result = false;
            }
            boolean allColsZeros = true;
            for (int j = 0; j < n; ++j) {
                if (cols[j] != ORinMatrix.State.MUST_ZERO) {
                    allColsZeros = false;
                }
            }
            if (allColsZeros && mustRow) {
                result = false;
            }
            if (!result) {
                out.println("NO");
            } else {
                out.println("YES");
                for (int i = 0; i < m; ++i) {
                    for (int j = 0; j < n; ++j) {
                        if (rows[i] == ORinMatrix.State.MUST_ZERO || cols[j] == ORinMatrix.State.MUST_ZERO) {
                            out.print("0 ");
                        } else {
                            out.print("1 ");
                        }
                    }
                    out.println();
                }
            }
        }

        private boolean adjustRows(Map<Integer, List<Integer>> colToRows, int j, ORinMatrix.State[] rows) {
            if (colToRows.containsKey(j)) {
                for (int row : colToRows.get(j)) {
                    if (rows[row] == ORinMatrix.State.MUST_ZERO) {
                        return false;
                    }
                    rows[row] = ORinMatrix.State.MUST_ONE;
                    mustRow = true;
                }
            }
            return true;
        }

        private boolean adjustCols(Map<Integer, List<Integer>> rowToColumns, int i, ORinMatrix.State[] cols) {
            if (rowToColumns.containsKey(i)) {
                for (int col : rowToColumns.get(i)) {
                    if (cols[col] == ORinMatrix.State.MUST_ZERO) {
                        return false;
                    }
                    cols[col] = ORinMatrix.State.MUST_ONE;
                    mustCol = true;
                }
            }
            return true;
        }

        static enum State {
            MUST_ONE,
            MUST_ZERO,
            COULD_ONE,;
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}