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
{
    public static long MIN(long a,long b)
    {
        if(a<b)
            return a;
        return b;
    }
    public static int MAX(int a,int b)
    {
        if(a>b)
            return a;
        return b;
    }
    public static int BS(int[] x,int val,int n)
    {
       // int n = x.length;
        int l=0,h=n-1,ans=0;
        while(l<=h)
        {
            int mid = (l+h)/2;
            if(x[mid]<=val)
            {
                ans=mid;
                l=mid+1;
            }
            else
                h=mid-1;
        }
        return ans;
    }
    public static boolean check(int[][] ans,int[][] a,int n,int m,BufferedWriter bw) throws IOException
    {
        int[] r = new int[n];
        int[] c = new int[m];
        for(int i=0;i<n;i++)
        {
            int val = 0;
            for(int j=0;j<m;j++)
            {
                val = val|ans[i][j];
            }
            r[i] = val;
        }
        for(int j=0;j<m;j++)
        {
            int val = 0;
            for(int i=0;i<n;i++)
            {
                val = val|ans[i][j];
            }
            c[j] = val;
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(a[i][j]!=(r[i]|c[j]))
                    return false;
            }
        }
        return true;
    }
    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int t = 1;
        while(t-->0)
        {
            String[] inp = br.readLine().split(" ");
            int n = Integer.parseInt(inp[0]);
            int m = Integer.parseInt(inp[1]);
            int[][] a = new int[n][m];
            for(int i=0;i<n;i++)
            {
                String[] inp1 = br.readLine().split(" ");
                for(int j=0;j<m;j++)
                {
                    a[i][j] = Integer.parseInt(inp1[j]);
                }
            }
                int[] r = new int[n];
                int[] c = new int[m];
                for(int i=0;i<n;i++)
                {
                    int val = Integer.MAX_VALUE;
                    for(int j=0;j<m;j++)
                    {
                        val = val&a[i][j];
                    }
                    r[i] = val;
                }
                for(int j=0;j<m;j++)
                {
                    int val = Integer.MAX_VALUE;
                    for(int i=0;i<n;i++)
                    {
                        val = val&a[i][j];
                    }
                    c[j] = val;
                }
                int[][] ans = new int[n][m];
                for(int i=0;i<n;i++)
                {
                    for(int j=0;j<m;j++)
                    {
                        ans[i][j] = r[i]&c[j];
                    }
                }
                if(check(ans,a,n,m,bw))
                {
                    bw.write("YES\n");
                    for(int i=0;i<n;i++)
                    {
                        for(int j=0;j<m;j++)
                        {
                            bw.write(ans[i][j]+" ");
                        }
                        bw.write("\n");
                    }
                }
                else
                    bw.write("NO\n");
            }
        bw.flush();
    }
}

class pair{
    int x,y;
    pair(int x,int y)
    {
        this.x = x;
        this.y = y;
    }
}