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

Solution:
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
  for (long long int i = 2; i <= (long long int)sqrt(n); i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t--) {
    long long int m, n;
    cin >> m >> n;
    vector<vector<long long int>> a(m, vector<long long int>(n)),
        b(m, vector<long long int>(n, 1));
    for (long long int i = 0; i < m; i++)
      for (long long int j = 0; j < n; j++) cin >> a[i][j];
    for (long long int i = 0; i < m; i++) {
      for (long long int j = 0; j < n; j++) {
        if (a[i][j] == 1) continue;
        for (long long int ii = 0; ii < m; ii++) b[ii][j] = 0;
        for (long long int ii = 0; ii < n; ii++) b[i][ii] = 0;
      }
    }
    vector<long long int> col(100), row(100);
    for (long long int i = 0; i < m; i++) {
      for (long long int j = 0; j < n; j++)
        if (b[i][j] == 1) {
          col[j] = 1;
          row[i] = 1;
        }
    }
    bool w = 1;
    for (long long int i = 0; i < m && w; i++) {
      for (long long int j = 0; j < n && w; j++) {
        if (a[i][j] == 0) {
          if (col[j] == 1 || row[i] == 1) w = 0;
        } else {
          if (!(col[j] == 1 || row[i] == 1)) w = 0;
        }
      }
    }
    if (w == 0)
      cout << "NO\n";
    else {
      cout << "YES\n";
      for (long long int i = 0; i < m; i++) {
        for (long long int j = 0; j < n; j++) cout << b[i][j] << " ";
        cout << '\n';
        ;
      }
    }
  }
  return 0;
}