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:
from math import *
#from bisect import *
#from collections import *
#from random import *
#from decimal import *"""
#from heapq import *
#from random import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(3*(10**5))
global flag
def inp():
    return int(input())
def st():
    return input().rstrip('\n')
def lis():
    return list(map(int,input().split()))
def ma():
    return map(int,input().split())
t=1
while(t):
    t-=1
    r=[]
    n,m=ma()
    for i in range(n):
        r.append(lis())
    ro=[0]*n
    co=[0]*m
    fl=0
    for i in range(n):
        for j in range(m):
            if(r[i][j]==0):
                ro[i]=1
                co[j]=1
    for i in range(n):
        for j in range(m):
            if(r[i][j]==1):
                if(ro[i] and co[j]):
                    fl=1
                    break
    res=[[0 for i in range(m)] for j in range(n)]
    for i in range(n):
        for j in range(m):
            if(ro[i]==0 and co[j]==0):
                res[i][j]=1
    rco=[0]*n
    cco=[0]*m
    res1=[x[:] for x in res]
    for i in range(n):
        for j in range(m):
            if(res[i][j]):
                rco[i]=1
                cco[j]=1
    for i in range(n):
        if(rco[i]):
            for k in range(m):
                res[i][k]=1
    for i in range(m):
        if(cco[i]):
            for k in range(n):
                res[k][i]=1
    for i in range(n):
        for j in range(m):
            if(res[i][j]!=r[i][j]):
                fl=1
                break
    if(fl):
        print("NO")
    else:
        print("YES")
        for i in res1:
            print(*i)