#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INF64 = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 10;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<int>> a(n, vector<int>(m));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) cin >> a[i][j];
  }
  auto check1 = [&]() {
    vector<int> ansr(n), ansc(m);
    int div = 0;
    auto b = a;
    auto checkR = [&](int i) {
      int cnt0 = 0, cnt1 = 0;
      for (int j = 0; j < m; ++j) {
        if (ansc[j]) b[i][j] ^= 1;
      }
      for (int j = 0; j < m; ++j) {
        if (b[i][j] == 0)
          ++cnt0;
        else
          break;
      }
      for (int j = m - 1; j >= 0; --j) {
        if (b[i][j] == 1)
          ++cnt1;
        else
          break;
      }
      if (cnt0 == m) {
        if (div) ansr[i] = 1;
        return true;
      }
      if (cnt1 == m) {
        if (!div) ansr[i] = 1;
        return true;
      }
      if (cnt0 + cnt1 == m) {
        if (++div > 1) return false;
        return true;
      }
      cnt0 = cnt1 = 0;
      for (int j = 0; j < m; ++j) {
        if (b[i][j] == 1)
          ++cnt1;
        else
          break;
      }
      for (int j = m - 1; j >= 0; --j) {
        if (b[i][j] == 0)
          ++cnt0;
        else
          break;
      }
      if (cnt0 + cnt1 == m) {
        if (++div > 1) return false;
        ansr[i] = 1;
        return true;
      }
      return false;
    };
    for (int j = 0; j < m; ++j) {
      if (b[0][j] == 1) ansc[j] = 1;
    }
    for (int i = 1; i < n; ++i) {
      if (!checkR(i)) {
        return false;
      }
    }
    cout << "YES\n";
    for (auto i : ansr) cout << i;
    cout << '\n';
    for (auto i : ansc) cout << i;
    cout << '\n';
    return true;
  };
  auto check2 = [&]() {
    vector<int> ansr(n), ansc(m);
    int div = 0;
    auto b = a;
    auto checkR = [&](int i) {
      int cnt0 = 0, cnt1 = 0;
      for (int j = 0; j < m; ++j) {
        if (ansc[j]) b[i][j] ^= 1;
      }
      for (int j = 0; j < m; ++j) {
        if (b[i][j] == 0)
          ++cnt0;
        else
          break;
      }
      for (int j = m - 1; j >= 0; --j) {
        if (b[i][j] == 1)
          ++cnt1;
        else
          break;
      }
      if (cnt0 == m) {
        if (div) ansr[i] = 1;
        return true;
      }
      if (cnt1 == m) {
        if (!div) ansr[i] = 1;
        return true;
      }
      if (cnt0 + cnt1 == m) {
        if (++div > 1) return false;
        return true;
      }
      cnt0 = cnt1 = 0;
      for (int j = 0; j < m; ++j) {
        if (b[i][j] == 1)
          ++cnt1;
        else
          break;
      }
      for (int j = m - 1; j >= 0; --j) {
        if (b[i][j] == 0)
          ++cnt0;
        else
          break;
      }
      if (cnt0 + cnt1 == m) {
        if (++div > 1) return false;
        ansr[i] = 1;
        return true;
      }
      return false;
    };
    for (int j = 0; j < m; ++j) {
      if (b[n - 1][j] == 0) ansc[j] = 1;
    }
    for (int i = 0; i < n - 1; ++i) {
      if (!checkR(i)) {
        return false;
      }
    }
    cout << "YES\n";
    for (auto i : ansr) cout << i;
    cout << '\n';
    for (auto i : ansc) cout << i;
    cout << '\n';
    return true;
  };
  if (!check1() && !check2()) {
    cout << "NO\n";
  }
  return 0;
}
