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:
//package hashing;

import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class ORinMatrix {

    public static int orOperation(int [][] A, int row, int col)
    {
        for(int i=0; i<A[0].length; i++)
        {
            if(A[row][i] == 1)
            {
                return 1;
            }
        }
        for (int[] ints : A) {
            if (ints[col] == 1) {
                return 1;
            }
        }
         return 0;
    }

    public static void change(int [][] A, int row, int col)
    {
       for(int i=0; i<A[0].length; i++)
       {
           A[row][i] = 0;
       }
       for(int i=0; i<A.length; i++)
       {
           A[i][col] = 0;
       }
    }

    public static void print(int [][] A)
    {
        for (int[] ints : A) {
            for (int j = 0; j < A[0].length; j++) {
                System.out.print(ints[j] + " ");
            }
            System.out.println();
        }
    }

    public static void main(String [] args)throws java.io.IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int[] arr = Arrays.stream(br.readLine().split("\\s+")).mapToInt(Integer::valueOf).toArray();
        int m = arr[0];
        int n = arr[1];
////        System.out.println(m + " " + n);
        int [][] B = new int[m][n];
        for(int i=0; i<m; i++)
        {
            int[] input = Arrays.stream(br.readLine().split("\\s+")).mapToInt(Integer::valueOf).toArray();
            B[i] = input;
        }

        int [][] A = new int[m][n];
        for(int i=0; i<m; i++)
        {
            Arrays.fill(A[i], 1);
        }

        for(int i=0; i<m; i++)
        {
            for(int j=0; j<n; j++)
            {
                if(B[i][j] == 0)
                {
                    change(A, i, j);
                }
            }
        }

        boolean yes = true;
        for(int i=0; i<m; i++)
        {
            for(int j=0; j<n; j++)
            {
                if(B[i][j] != orOperation(A, i, j))
                {
                    yes = false;
                    break;
                }
            }
        }
        if(yes)
        {
            System.out.println("YES");
            print(A);
        }
        else
        {
            System.out.println("NO");
        }
    }
}