#include <bits/stdc++.h>
using namespace std;
template <class T>
T bigmod(T b, T p, T m) {
  if (!p) return 1;
  T res = (bigmod(b, p / 2, m)) % m;
  res = (res * res) % m;
  if (p & 1) res = (res * b) % m;
  return res % m;
}
template <class T>
T modinv(T b, T m) {
  return bigmod(b, m - 2, m);
}
const long long INF = 1000000007;
const long long MOD = 1000000007;
const int MAX = 1000005;
const int sz = 100005;
int main() {
  int a[105][105], b[105][105], m, n, i, j, k, l, p, f, F;
  while (cin >> m >> n) {
    memset(a, -1, sizeof(a));
    for (i = 1; i <= m; i++)
      for (j = 1; j <= n; j++) cin >> b[i][j];
    for (i = 1; i <= m; i++) {
      for (j = 1; j <= n; j++) {
        if (b[i][j] == 0) {
          for (k = 1; k <= n; k++) a[i][k] = 0;
          for (k = 1; k <= m; k++) a[k][j] = 0;
        }
      }
    }
    for (i = 1; i <= m; i++)
      for (j = 1; j <= n; j++) a[i][j] *= -1;
    F = 0;
    for (i = 1; i <= m; i++) {
      for (j = 1; j <= n; j++) {
        if (b[i][j]) {
          f = 1;
          for (k = 1; k <= n; k++)
            if (a[i][k]) f = 0;
          if (f)
            for (k = 1; k <= m; k++)
              if (a[k][j]) f = 0;
          if (f) {
            F = 1;
            break;
          }
        }
      }
      if (F) break;
    }
    if (F)
      cout << "NO\n";
    else {
      cout << "YES\n";
      for (i = 1; i <= m; i++) {
        for (j = 1; j <= n; j++) cout << a[i][j] << " ";
        cout << endl;
      }
    }
  }
  return 0;
}
