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 {
	
	static FastScanner fs = new FastScanner();
	
	private static boolean check(int a[][], int b[][])
	{
		for (int i=0; i<a.length; ++i)
		{
			for(int j=0; j<a[i].length; ++j)
			{
				if(a[i][j] != b[i][j]) return false;
			}
		}
		return true;
	}
	
	public static void main(String[] args) 
	{
		int n=fs.nextInt(), m = fs.nextInt();
		int a[][] = new int[n][m];
		int b[][] = new int[n][m];
		int c[][] = new int[n][m];
		for (int i=0; i < n; ++i) b[i] = fs.readArr(m);
		for (int i=0; i < n; ++i)
		{
			for(int j = 0; j < m; ++j)
			{
				int s = b[i][j];
				for(int k =0; k < m; ++k)
				{
					s &= b[i][k];
				}
				for(int k =0; k < n; ++k)
				{
					s &= b[k][j];
				}
				a[i][j] = s;
			}
		}
		for (int i=0; i < n; ++i)
		{
			for(int j = 0; j < m; ++j)
			{
				int s = a[i][j];
				for(int k =0; k < m; ++k)
				{
					s |= a[i][k];
				}
				for(int k =0; k < n; ++k)
				{
					s |= a[k][j];
				}
				c[i][j] = s;
			}
		}
		
		if(check(b, c))
		{
			print("YES");
			for(int i=0; i<n; ++i) logarr(a[i]);
		}
		else print("NO");
		
	}
	
	static void print(int a) { System.out.println(a); }
    static void print(long a) { System.out.println(a); }
    static void print(double a) { System.out.println(a); }
    static void print(String a) { System.out.println(a); }
    static void print(char[] a) { for(char i : a) System.out.print(i); System.out.println(); }
 
    static int Ceil(int a, int b) { return (int)Math.ceil(a / (double)b); }
 
    static int Min(int a[]) {
        int min=0;
        for(int i:a) {
            min=Math.min(min, i);
        }
        return min;
    }
 
    static int Max(int a[]) {
        int max=0;
        for(int i:a) {
            max=Math.max(max, i);
        }
        return max;
    }
    
    static void reverse(int arr[], int s, int e)
    {
    	int n = arr.length;
    	int a[] = new int[n];
		for (int i=0; i<n; ++i) a[i] = arr[i];
		int j = 0;
		for (int i = s; i < e; ++i) 
		{
			arr[i] = a[e-j];
			j++;
		}
    }
    
    static void reverse(char arr[], int s, int e)
    {
    	int n = arr.length;
    	char a[] = new char[n];
		for (int i=0; i<n; ++i) a[i] = arr[i];
		int j = 0;
		for (int i = s; i < e; ++i) 
		{
			arr[i] = a[e-j];
			j++;
		}
    }
 
    static int[] toArray(ArrayList<Integer> ar) {
        int n=ar.size();
        int ans[]=new int[n];
        int i=0;
        for(int j:ar) {
            ans[i]=j;
            i++;
        }
        return ans;
    }
 
    static void logarr(int a[]) {
        for(int i : a) {
            System.out.print(i+" ");
        }
        System.out.println();
    }
 
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public FastScanner()
        {
            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;
        }
 
        int[] readArr(int n)
        {
            int arr[]=new int[n];
            for(int i=0; i<n; ++i) arr[i]=fs.nextInt();
            return arr;
        }
 
        long[] readLongArr(int n)
        {
            long arr[]=new long[n];
            for(int i=0; i<n; ++i) arr[i]=fs.nextInt();
            return arr;
        }
 
    }

}