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;
void initCode() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
const long long int N = 1000000007;
vector<double> primeNumber;
void SieveOfEratosthenes(int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) {
        prime[i] = false;
      }
    }
  }
  long long int i = 0;
  for (long long int p = 2; p <= n; p++) {
    if (prime[p]) {
      primeNumber.push_back((double)p);
    }
  }
}
long long int mod(long long int a) { return (a % N + N) % N; }
int arr[101][101];
int ans[101][101];
void pre() {
  for (int i = 0; i < 101; i++) {
    for (int j = 0; j < 101; j++) ans[i][j] = 1;
  }
}
void sol() {
  int n, m;
  cin >> n >> m;
  pre();
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < m; j++) {
      cin >> arr[i][j];
    }
  }
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < m; j++) {
      if (arr[i][j] == 0) {
        for (long long int k = 0; k < n; k++) {
          ans[k][j] = 0;
        }
        for (long long int r = 0; r < m; r++) {
          ans[i][r] = 0;
        }
      }
    }
  }
  int row[n];
  int col[m];
  for (long long int i = 0; i < n; i++) {
    row[i] = 0;
    for (long long int j = 0; j < m; j++) {
      if (ans[i][j] == 1) {
        row[i] = 1;
      }
    }
  }
  for (long long int i = 0; i < m; i++) {
    col[i] = 0;
    for (long long int j = 0; j < n; j++) {
      if (ans[j][i] == 1) {
        col[i] = 1;
      }
    }
  }
  bool x = 1;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < m; j++) {
      if (arr[i][j] == 1) {
        if (!(row[i] == 1 || col[j] == 1)) {
          cout << "NO" << endl;
          return;
        }
      }
      if (arr[i][j] == 0) {
        if (!(row[i] == 0 && col[j] == 0)) {
          cout << "NO" << endl;
          return;
        }
      }
    }
  }
  cout << "YES" << endl;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < m; j++) {
      cout << ans[i][j] << " ";
    }
    cout << endl;
  }
}
int main() {
  initCode();
  sol();
  return 0;
}