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

Solution:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

def main():
  (h, w) = getLineAs(int)
  b = []

  for i in xrange(h):
    b.append(getLineAs(int))

  hh = array(h, 0)
  ww = array(w, 0)

  for i in xrange(h):
    f = [0, 0]
    for j in xrange(w):
      f[b[i][j]] += 1
    if f[1] == w:
      hh[i] = 1

  for j in xrange(w):
    f = [0, 0]
    for i in xrange(h):
      f[b[i][j]] += 1
    if f[1] == h:
      ww[j] = 1

  ans = array(h, array(w, 0))
  uh = array(h, 0)
  uw = array(w, 0)
  for i in xrange(h):
    for j in xrange(w):
      if hh[i] and ww[j]:
        ans[i][j] = 1
        uh[i] = 1
        uw[j] = 1

  for i in xrange(h):
    for j in xrange(w):
      if b[i][j] == 1 and uh[i] == 0 and uw[j] == 0:
        print "NO"
        return 0

  print "YES"
  for i in xrange(h):
    print " ".join(map(str, ans[i]))

  return 0

## -------------------------------------------
## TEMPLATE

from sys import setrecursionlimit
from copy import deepcopy
from math import sqrt

def getLineAs(tp):
        return map(tp, raw_input().split())

def array(n, init = 0):
        return [deepcopy(init) for i in range(n)]

def count_if(lst, pred):
        return sum(map(lambda x: 1 if pred(x) else 0, lst))

if __name__ == "__main__":
        setrecursionlimit(1024 * 1024)
        main()