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

public class ORinMatrix {

    public static void main(String args[])throws IOException{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        StringTokenizer st = new StringTokenizer(br.readLine());
        int r = Integer.parseInt(st.nextToken());
        int c = Integer.parseInt(st.nextToken());
        int a[][] = new int[r][c];

            for(int i = 0; i<r; i++){

                StringTokenizer stt = new StringTokenizer(br.readLine());
                for(int j = 0; j<c; j++){

                    a[i][j] = Integer.parseInt(stt.nextToken());
                }
            }

            int and[][] = new int[r][c];

                for(int i = 0; i<r; i++){
                    for(int j = 0; j<c; j++){

                        int ans =calAnd(a[i]);

                        for(int k = 0; k<r; k++) ans = ans&a[k][j];

                        and[i][j] = ans;
                    }
                }

//                for(int i = 0; i<r; i++){
//                    for(int j = 0; j<c; j++){
//                        System.out.print(and[i][j]+" ");
//                    }
//                    System.out.println();
//                }

                String str = compare(a,and);

                if(str.equals("NO")) System.out.println(str);
                else{
                    System.out.println(str);

                    for(int i = 0; i<r; i++){
                        for(int j = 0; j<c; j++){
                            System.out.print(and[i][j]+" ");
                        }
                        System.out.println();
                    }
                }
    }

    static int calAnd(int a[]){
        int n = a.length;
        int ans = a[0];

        for(int i = 1; i<n; i++){
            ans = ans&a[i];
        }

        return ans;
    }

    static String compare(int a[][] , int and[][]){

        int r= a.length;
        int c = a[0].length;

//

        int Or[][] = new int[r][c];

            for(int i = 0; i<r; i++){
                for(int j = 0; j<c; j++){

                    int ans = calOr(and[i]);

                        for(int k = 0; k<r; k++){
                            ans = ans | and[k][j];
                        }

                        Or[i][j] = ans;
                }
            }
//
//        for(int i = 0; i<r; i++){
//            for(int j = 0; j<c; j++){
//
//                System.out.print(Or[i][j]+" ");
//            }
//            System.out.println();
//        }

        for(int i = 0; i<r; i++){
            for(int j = 0; j<c; j++){

                if(a[i][j] != Or[i][j]){
                    return "NO";
                }
            }
        }
        return "YES";


    }

    static int calOr(int a[]){

        int n = a.length;
        int ans = a[0];

            for(int i = 1; i<n; i++){
                ans = ans|a[i];

            }

            return  ans;
    }
}