#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a[205][205];
int tc[205], rc[205];
void ck(bool one) {
  for (int i = 2; i <= n; i++) {
    bool fg = 0, ok = 1;
    int pre0 = -1;
    for (int(z) = 0; (z) < (int)(2); (z)++) {
      rc[i] = z;
      ok = 1;
      fg = 0;
      pre0 = 0;
      for (int(j) = 1; (j) <= (int)(m); (j)++) {
        int tar = a[i][j] ^ tc[j] ^ rc[i];
        if (tar == 1)
          fg = 1;
        else if (fg) {
          ok = 0;
          break;
        }
        if (tar == 0) pre0++;
      }
      if (ok) break;
    }
    if (!ok) return;
    if (pre0 != 0 && pre0 != m) {
      if (one) return;
      one = 1;
    }
    if (pre0 == 0) {
      if (one)
        continue;
      else {
        rc[i] ^= 1;
        continue;
      }
    }
    if (pre0 == m) {
      if (one) {
        rc[i] ^= 1;
        continue;
      } else
        continue;
    }
  }
  puts("YES");
  for (int(i) = 1; (i) <= (int)(n); (i)++) printf("%d", rc[i]);
  puts("");
  for (int(j) = 1; (j) <= (int)(m); (j)++) printf("%d", tc[j]);
  puts("");
  exit(0);
}
void cal() {
  for (int(j) = 1; (j) <= (int)(m); (j)++) {
    tc[j] = a[1][j] == 0 ? 1 : 0;
  }
  ck(1);
  for (int(j) = 1; (j) <= (int)(m); (j)++) {
    if (a[1][j] == 0)
      tc[j] = 0;
    else
      tc[j] = 1;
    ck(j < m);
  }
}
void fmain(int tid) {
  scanf("%d%d", &n, &m);
  for (int(i) = 1; (i) <= (int)(n); (i)++)
    for (int(j) = 1; (j) <= (int)(m); (j)++) scanf("%d", &a[i][j]);
  cal();
  rc[1] = 1;
  for (int(j) = 1; (j) <= (int)(m); (j)++) a[1][j] ^= 1;
  cal();
  etp();
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
