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:
__author__ = "runekri3"


def get_answer():
    m, n = list(map(int, input().split()))
    total_rows, total_cols = m, n
    rows = []
    for row_i in range(total_rows):
        row = list(map(int, input().split()))
        rows.append(row)
    cols = [[row[col_i] for row in rows] for col_i in range(total_cols)]

    filled_rows = []
    must_be_filled_cols = set()

    for row_i, row in enumerate(rows):
        ones = row.count(1)
        if ones != 0:
            if ones != total_cols:
                [must_be_filled_cols.add(col_i) for col_i in range(total_cols) if row[col_i] == 1]
            else:
                filled_rows.append(row_i)
    if len(filled_rows) == total_rows:
        must_be_filled_cols = set(range(total_cols))
    if len(must_be_filled_cols) == 0 or len(filled_rows) == 0:
        if len(must_be_filled_cols) != 0 or len(filled_rows) != 0:
            print("NO")
            return
    for must_be_filled_col_i in must_be_filled_cols:
        col = cols[must_be_filled_col_i]
        ones = col.count(1)
        if ones != total_rows:
            print("NO")
            return
    solution_matrix = [[0 for _ in range(total_cols)] for _ in range(total_rows)]
    for row_i in filled_rows:
        if len(must_be_filled_cols) == 0:
            solution_matrix[row_i] = [1] * total_cols
        for col_i in must_be_filled_cols:
            solution_matrix[row_i][col_i] = 1

    print("YES")
    [print(" ".join(map(str, row))) for row in solution_matrix]


get_answer()