Problem: You are given a binary matrix a of size n × m. A binary matrix is a matrix where each element is either 0 or 1.

You may perform some (possibly zero) operations with this matrix. During each operation you can inverse the row of this matrix or a column of this matrix. Formally, inverting a row is changing all values in this row to the opposite (0 to 1, 1 to 0). Inverting a column is changing all values in this column to the opposite.

Your task is to sort the initial matrix by some sequence of such operations. The matrix is considered sorted if the array [a_{1, 1}, a_{1, 2}, ..., a_{1, m}, a_{2, 1}, a_{2, 2}, ..., a_{2, m}, ..., a_{n, m - 1}, a_{n, m}] is sorted in non-descending order.

Input

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 200) — the number of rows and the number of columns in the matrix.

The next n lines contain m integers each. The j-th element in the i-th line is a_{i, j} (0 ≤ a_{i, j} ≤ 1) — the element of a at position (i, j).

Output

If it is impossible to obtain a sorted matrix, print "NO" in the first line.

Otherwise print "YES" in the first line. In the second line print a string r of length n. The i-th character r_i of this string should be '1' if the i-th row of the matrix is inverted and '0' otherwise. In the third line print a string c of length m. The j-th character c_j of this string should be '1' if the j-th column of the matrix is inverted and '0' otherwise. If there are multiple answers, you can print any.

Examples

Input


2 2
1 1
0 1


Output


YES
00
10


Input


3 4
0 0 0 1
0 0 0 0
1 1 1 1


Output


YES
010
0000


Input


3 3
0 0 0
1 0 1
1 1 0


Output


NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double PI = acos(-1);
template <class T, class S>
inline void add(T& a, S b) {
  a += b;
  if (a >= mod) a -= mod;
}
template <class T, class S>
inline void sub(T& a, S b) {
  a -= b;
  if (a < 0) a += mod;
}
template <class T, class S>
inline bool chkmax(T& a, S b) {
  return a < b ? a = b, true : false;
}
template <class T, class S>
inline bool chkmin(T& a, S b) {
  return a > b ? a = b, true : false;
}
int fa[N], row[N], col[N];
int now[N];
bool vis[N];
int getRoot(int x) { return x == fa[x] ? x : fa[x] = getRoot(fa[x]); }
int n, m, all;
int a[N][N];
void print() {
  puts("YES");
  for (int i = 1; i <= 2 * all; i++) {
    if (vis[i]) continue;
    int rt = getRoot(i);
    for (int j = 1; j <= 2 * all; j++) {
      if (vis[j]) continue;
      if (getRoot(j) == rt) {
        if (j <= all) {
          if (j <= n) {
            row[j] = 0;
            vis[j] = true;
            vis[j + all] = true;
          } else {
            col[j - n] = 0;
            vis[j] = true;
            vis[j + all] = true;
          }
        } else {
          if (j <= n + all) {
            row[j - all] = 1;
            vis[j] = true;
            vis[j - all] = true;
          } else {
            col[j - all - n] = 1;
            vis[j] = true;
            vis[j - all] = true;
          }
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) printf("%d", row[i]);
  puts("");
  for (int i = 1; i <= m; i++) printf("%d", col[i]);
  puts("");
}
bool check(int x, int y) {
  for (int i = 1; i <= 2 * all; i++) fa[i] = now[i];
  for (int i = x; i <= n; i++) {
    for (int j = (i == x ? y : 1); j <= m; j++) {
      if (a[i][j] == 0) {
        if (getRoot(i + all) == getRoot(j + n + all)) {
          return false;
        }
        fa[getRoot(i)] = getRoot(j + n + all);
        fa[getRoot(i + all)] = getRoot(j + n);
      } else {
        if (getRoot(i + all) == getRoot(j + n)) {
          return false;
        }
        fa[getRoot(i)] = getRoot(j + n);
        fa[getRoot(i + all)] = getRoot(j + n + all);
      }
    }
  }
  return 1;
}
int main() {
  scanf("%d%d", &n, &m);
  all = n + m;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
  bool flag = true;
  for (int i = 1; i <= 2 * all; i++) now[i] = i;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (check(i, j)) {
        print();
        return 0;
      }
      for (int k = 1; k <= 2 * all; k++) fa[k] = now[k];
      if (a[i][j] == 0) {
        if (getRoot(i + all) == getRoot(j + n)) flag = false;
        fa[getRoot(i)] = getRoot(j + n);
        fa[getRoot(i + all)] = getRoot(j + n + all);
      } else {
        if (getRoot(i + all) == getRoot(j + n + all)) flag = false;
        fa[getRoot(i)] = getRoot(j + n + all);
        fa[getRoot(i + all)] = getRoot(j + n);
      }
      for (int k = 1; k <= 2 * all; k++) now[k] = fa[k];
      if (!flag) break;
    }
  }
  if (flag) {
    print();
  }
  puts("NO");
  return 0;
}