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 PYTHON3):

Solution:
n,m=[int(x) for x in input().split()]
mat=[]
mat1=[]
for x in range(n):
    l=[int(z) for z in input().split()]
    mat.append(l)
    l1=[0 for x in range(m)]
    mat1.append(l1)
rsum=[]
for x in range(n):
    su=0
    for y in range(m):
        su=su+mat[x][y]
    if(su==m):
        su=1
    else:
        su=0
    rsum.append(su)
s=sum(rsum)
csum=[]
for x in range(m):
    su=0
    for y in range(n):
        su=su+mat[y][x]
    if(su==n):
        su=1
    else:
        su=0
    csum.append(su)
s1=sum(csum)
flag=0
for x in range(n):
    for y in range(m):
        val=mat[x][y]
        a=rsum[x]
        b=csum[y]
        if(val==0 and(rsum[x]>0 or csum[y]>0)):
            flag=1
            break
        elif(val==1 and(rsum[x]==0 and csum[y]==0)):
            flag=1 
            break
        elif(s==0 and s1>0):
            flag=1 
            break
        elif(s>0 and s1==0):
            flag=1 
            break
        else:
            mat1[x][y]=min(rsum[x],csum[y])
    if(flag==1):
        print("NO")
        break
if(flag==0):
    print("YES")
    for x in range(n):
        for y in range(m):
            print(mat1[x][y],end=" ")
        print()