#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const long long &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
  _W(x.first);
  putchar(' ');
  _W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
int MOD = 1e9 + 7;
void ADD(long long &x, long long v) {
  x = (x + v) % MOD;
  if (x < 0) x += MOD;
}
const int SIZE = 210;
int AA[SIZE][SIZE], BB[SIZE][SIZE];
int n, m;
int col[SIZE], row[SIZE];
void check(int x) {
  for (int i = 0; i < (m); ++i) {
    col[i] = (i >= x) ^ AA[0][i];
    BB[0][i] = col[i] ^ AA[0][i];
  }
  for (int i = (1); i < (n); ++i) {
    bool suc = 0;
    for (int j = 0; j < (2); ++j) {
      row[i] = AA[i][0] ^ j ^ col[0];
      for (int k = 0; k < (m); ++k) {
        BB[i][k] = AA[i][k] ^ row[i] ^ col[k];
      }
      if (BB[i][0] < BB[i - 1][m - 1]) continue;
      bool fail = 0;
      for (int k = (1); k < (m); ++k) {
        if (BB[i][k] < BB[i][k - 1]) {
          fail = 1;
        }
      }
      if (fail) continue;
      suc = 1;
      break;
    }
    if (!suc) return;
  }
  W("YES");
  for (int i = 0; i < (n); ++i) _W(row[i]);
  W("");
  for (int i = 0; i < (m); ++i) _W(col[i]);
  W("");
  exit(0);
}
int main() {
  R(n, m);
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (m); ++j) {
      R(AA[i][j]);
    }
  for (int i = (1); i <= (m); ++i) {
    check(i);
  }
  W("NO");
  return 0;
}
