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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class SolverB {

        public static void main(String[] Args) throws NumberFormatException,
                        IOException {
                new SolverB().Run();
        }

        PrintWriter pw;
        StringTokenizer Stok;
        BufferedReader br;

        public String nextToken() throws IOException {
                while (Stok == null || !Stok.hasMoreTokens()) {
                        Stok = new StringTokenizer(br.readLine());
                }
                return Stok.nextToken();
        }

        public int nextInt() throws NumberFormatException, IOException {
                return Integer.parseInt(nextToken());
        }

        public double nextDouble() throws NumberFormatException, IOException {
                return Double.parseDouble(nextToken());
        }

        public long nextLong() throws NumberFormatException, IOException {
                return Long.parseLong(nextToken());
        }

        int hei, wid;
        int[][] b, res, b2;

        boolean checkCell(int i0, int j0){
                for (int i=0; i<hei; i++){
                        if (b[i][j0]==0)
                                return false;
                }
                for (int j=0; j<wid; j++){
                        if (b[i0][j]==0)
                                return false;
                }
                return true;
        }

        void fillRes(){
                for (int i=0; i<hei; i++){
                        for (int j=0; j<wid; j++){
                                if (checkCell(i,j))
                                        res[i][j]=1;
                        }
                }
        }

        void makeb2(){
                b2=new int[hei][wid];
                for (int i=0; i<hei; i++){
                        for (int j=0; j<wid; j++){
                                if (res[i][j]>0){
                                        for (int j2=0; j2<wid; j2++){
                                                b2[i][j2]=1;
                                        }
                                        for (int i2=0; i2<hei; i2++){
                                                b2[i2][j]=1;
                                        }
                                }
                        }
                }
        }

        boolean check(){
                for (int i=0; i<hei; i++){
                        for (int j=0; j<wid; j++){
                                if (b[i][j]!=b2[i][j])
                                        return false;
                        }
                }
                return true;
        }

        public void Run() throws NumberFormatException, IOException {
                //br = new BufferedReader(new FileReader("input.txt")); pw = new PrintWriter("output.txt");
                br=new BufferedReader(new InputStreamReader(System.in));  pw=new PrintWriter(new OutputStreamWriter(System.out));

                hei=nextInt();
                wid=nextInt();
                b=new int[hei][wid];
                res=new int[hei][wid];
                for (int i=0; i<hei; i++){
                        for (int j=0; j<wid; j++){
                                b[i][j]=nextInt();
                        }
                }
                fillRes();
                makeb2();
                if (check()){
                        pw.println("YES");
                        for (int i=0; i<hei; i++){
                                for (int j=0; j<wid; j++){
                                        pw.print(res[i][j]);
                                        pw.print(' ');
                                }
                                pw.println();
                        }
                } else
                        pw.println("NO");
                pw.flush();
                pw.close();
        }

}