#include <bits/stdc++.h>
using namespace std;
inline int lowbit(int x) { return x & (-x); }
inline int read() {
  int X = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  return w ? -X : X;
}
template <typename A, typename B, typename C>
inline A fpow(A x, B p, C lyd) {
  A ans = 1;
  for (; p; p >>= 1, x = 1LL * x * x % lyd)
    if (p & 1) ans = 1LL * x * ans % lyd;
  return ans;
}
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T>
inline T max(T x, T y, T z) {
  return max(max(x, y), z);
}
template <typename T>
inline T min(T x, T y, T z) {
  return min(min(x, y), z);
}
const double eps = 1e-9;
const int maxn = 220;
const long long INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int n, m;
int a[maxn][maxn];
int cul[maxn], row[maxn];
bool check() {
  int p = 0;
  for (int i = 1; i <= n; ++i) {
    int x = cul[1] ^ a[i][1];
    for (int j = 2; j <= m; ++j) {
      if ((a[i][j] ^ cul[j]) != x) {
        if (p && p != i) return false;
        p = i;
      }
    }
  }
  if (p) {
    if ((cul[1] ^ a[p][1]) == 1)
      row[p] = 1;
    else
      row[p] = 0;
    int flag = 0;
    for (int i = 1; i <= m; ++i) {
      int x = cul[i] ^ a[p][i];
      if (x == 1) {
        flag = 1;
      } else if (x == 0) {
        if (flag) return false;
      }
    }
  }
  for (int i = 1; i < p; ++i) {
    if ((a[i][1] ^ cul[1]) == 1)
      row[i] = 1;
    else
      row[i] = 0;
  }
  for (int i = p + 1; i <= n; ++i) {
    if ((a[i][1] ^ cul[1]) == 1)
      row[i] = 0;
    else
      row[i] = 1;
  }
  return true;
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) a[i][j] = read();
  for (int i = 1; i <= m + 1; ++i) {
    for (int j = 1; j < i; ++j) {
      if (a[1][j] == 1)
        cul[j] = 1;
      else
        cul[j] = 0;
    }
    for (int j = i; j <= m; ++j) {
      if (a[1][j] == 1)
        cul[j] = 0;
      else
        cul[j] = 1;
    }
    int flag = 0;
    if (check()) flag = 1;
    if (flag) {
      puts("YES");
      for (int i = 1; i <= n; ++i) printf("%d", row[i]);
      puts("");
      for (int i = 1; i <= m; ++i) printf("%d", cul[i]);
      return 0;
    }
  }
  puts("NO");
  return 0;
}
