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

public class Main {
    // For fast input output
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            try {
                br = new BufferedReader(new FileReader("input.txt"));
                PrintStream out = new PrintStream(new FileOutputStream("output.txt"));
                System.setErr(new PrintStream(new FileOutputStream("error.txt")));
                System.setOut(out);
            } catch (Exception e) {
                br = new BufferedReader(new InputStreamReader(System.in));
            }
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    // end of fast i/o code
    static StringBuilder str = new StringBuilder("");

    public static void main(String[] args) {
        FastReader reader = new FastReader();
        int rows = reader.nextInt();
        int cols = reader.nextInt();
        if (rows == 1 && cols == 1) {
            System.out.println("YES");
            System.out.println(reader.nextInt());
            return;
        }
        int[][] grid = new int[rows][cols];
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++)
                grid[i][j] = reader.nextInt();
        }
        // for(int i = 0; i < rows; i++)
        // {
        // for(int j=0; j<cols; j++)
        // System.err.print(grid[i][j]+" ");
        // System.err.println();
        // }
        boolean[] rowstatus = new boolean[rows];
        boolean[] colstatus = new boolean[cols];
        for (int i = 0; i < rows; i++) {
            boolean status = true;
            for (int j = 0; j < cols; j++) {
                if (grid[i][j] == 0) {
                    status = false;
                    break;
                }
            }
            if (status)
                rowstatus[i] = true;
        }
        for (int j = 0; j < cols; j++) {
            boolean status = true;
            for (int i = 0; i < rows; i++) {
                if (grid[i][j] == 0) {
                    status = false;
                    break;
                }
            }
            if (status)
                colstatus[j] = true;
        }
        for (int i = 0; i < rows; i++)
            System.err.print(rowstatus[i] + " ");
        System.err.println();
        for (int i = 0; i < cols; i++)
            System.err.print(colstatus[i] + " ");
        boolean allzero = true;
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (grid[i][j] == 1) {
                    allzero = false;
                    break;
                }
            }
            if (!allzero)
                break;
        }
        System.err.println("allzero: "+allzero);
        if (allzero) {
            str.append("YES\n");
            for (int i = 0; i < rows; i++) {
                for (int j = 0; j < cols; j++)
                    str.append(0 + " ");
                str.append("\n");
            }
            System.out.println(str.toString());
            return;
        }
        boolean possible = true;
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (grid[i][j] == 1) {
                    if (!rowstatus[i] && !colstatus[j]) {
                        possible = false;
                        break;
                    }
                }

            }
            if (!possible)
                break;
        }
        boolean allrowszero = true;
        boolean allcolszero = true;
        for(int i = 0; i < rows; i++)
        {
            if(rowstatus[i])
            {
                allrowszero = false;
                break;
            }
        }
        for(int i = 0; i < cols; i++)
        {
            if(colstatus[i])
            {
                allcolszero = false;
                break;
            }
        }
        if (!possible || allcolszero || allrowszero) {
            System.out.println("NO");
            return;
        }
        int[][] resgrid = new int[rows][cols];
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (rowstatus[i] && colstatus[j])
                    resgrid[i][j] = 1;
                else
                    resgrid[i][j] = 0;
            }
        }

        // for(int i = 0; i < rows; i++)
        // {
        // if(rowstatus[i])
        // {
        // for(int j = 0; j < cols ; j++)
        // resgrid[i][j] = 1;
        // }
        // }
        // for(int j=0; j<cols; j++)
        // {
        // if(colstatus[j])
        // {
        // for(int i=0; i<rows; i++)
        // resgrid[i][j] = 1;
        // }
        // }
        System.out.println("YES");
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++)
                str.append(resgrid[i][j] + " ");
            str.append("\n");
        }
        System.out.println(str.toString());
    }
}