#include <bits/stdc++.h>
using namespace std;
template <class T, class T1>
inline int lower(const T& v, T1 x) {
  return lower_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T, class T1>
inline int upper(const T& v, T1 x) {
  return upper_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T>
inline T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
};
template <class T>
inline T pw(T a, T p, T M) {
  T result = 1;
  for (T sq = a; p; p >>= 1, sq = (sq * 1ll * sq) % M) {
    if (p & 1) {
      result = result * 1ll * sq % M;
    }
  }
  return result;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& a) {
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const vector<T1, T2>& a) {
  bool f = 0;
  os << "[";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "]";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const set<T1, T2>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "}";
  return os;
}
template <class T1, class T2, class T3>
ostream& operator<<(ostream& os, const map<T1, T2, T3>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x.first << ":" << x.second;
  }
  os << "}";
  return os;
}
struct _ {
  _() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(30);
    cout << fixed;
  }
};
const int N = 100;
int a[N][N];
int main() {
  int n, m;
  cin >> n >> m;
  int ix = 0, jx = 0, vx = 1e9;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
      if (vx > a[i][j]) {
        ix = i;
        jx = j;
        vx = a[i][j];
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] -= vx;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] != a[i][jx] + a[ix][j]) {
        cout << -1;
        return 0;
      }
    }
  }
  int k = 0;
  for (int i = 0; i < n; i++) {
    k += a[i][jx] + (m > n ? vx : 0);
  }
  for (int j = 0; j < m; j++) {
    k += a[ix][j] + (m <= n ? vx : 0);
  }
  cout << k << endl;
  for (int i = 0; i < n; i++) {
    for (int cnt = 0; cnt < a[i][jx] + (m > n ? vx : 0); cnt++) {
      cout << "row " << i + 1 << endl;
    }
  }
  for (int j = 0; j < m; j++) {
    for (int cnt = 0; cnt < a[ix][j] + (m <= n ? vx : 0); cnt++) {
      cout << "col " << j + 1 << endl;
    }
  }
  return 0;
}
