#include <bits/stdc++.h>
using namespace std;
void upd1(long long i, vector<vector<long long>> &mx, long long val) {
  for (int j = 0; j < mx[i].size(); ++j) mx[i][j] -= val;
}
void upd2(long long j, vector<vector<long long>> &mx, long long val) {
  for (int i = 0; i < mx.size(); ++i) {
    mx[i][j] -= val;
  }
}
int main() {
  long long n, m;
  cin >> n >> m;
  vector<vector<long long>> mx(n, vector<long long>(m));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> mx[i][j];
    }
  }
  vector<pair<pair<long long, long long>, long long>> ans;
  long long minn = 1e18;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      minn = min(minn, mx[i][j]);
    }
  }
  if (minn > 0) {
    if (n < m) {
      for (int i = 0; i < n; ++i) {
        ans.push_back({{1, minn}, i});
        upd1(i, mx, minn);
      }
    } else {
      for (int i = 0; i < m; ++i) {
        ans.push_back({{2, minn}, i});
        upd2(i, mx, minn);
      }
    }
  }
  if (n <= m) {
    long long cnt = 1;
    while (cnt != 0) {
      cnt = 0;
      long long maxx = 1e18;
      for (int i = 0; i < n; ++i) {
        maxx = 1e18;
        for (int j = 0; j < m; ++j) maxx = min(maxx, mx[i][j]);
        if (maxx > 0) {
          ++cnt;
          upd1(i, mx, maxx);
          ans.push_back({{1, maxx}, i});
        }
      }
      for (int j = 0; j < m; ++j) {
        maxx = 1e18;
        for (int i = 0; i < n; ++i) maxx = min(maxx, mx[i][j]);
        if (maxx > 0) {
          ++cnt;
          upd2(j, mx, maxx);
          ans.push_back({{2, maxx}, j});
        }
      }
    }
  } else {
    long long cnt = 1;
    while (cnt != 0) {
      cnt = 0;
      long long maxx = 1e18;
      for (int j = 0; j < m; ++j) {
        maxx = 1e18;
        for (int i = 0; i < n; ++i) maxx = min(maxx, mx[i][j]);
        if (maxx > 0) {
          ++cnt;
          upd2(j, mx, maxx);
          ans.push_back({{2, maxx}, j});
        }
      }
      for (int i = 0; i < n; ++i) {
        maxx = 1e18;
        for (int j = 0; j < m; ++j) maxx = min(maxx, mx[i][j]);
        if (maxx > 0) {
          ++cnt;
          upd1(i, mx, maxx);
          ans.push_back({{1, maxx}, i});
        }
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (mx[i][j] != 0) {
        cout << -1 << endl;
        return 0;
      }
    }
  }
  long long kolvo = 0;
  for (int i = 0; i < ans.size(); ++i) {
    kolvo += ans[i].first.second;
  }
  cout << kolvo << endl;
  string s1 = "row", s2 = "col", s;
  for (int i = 0; i < ans.size(); ++i) {
    if (ans[i].first.first == 2)
      s = s2;
    else
      s = s1;
    for (int j = 0; j < ans[i].first.second; ++j) {
      cout << s << " " << ans[i].second + 1 << endl;
    }
  }
  return 0;
}
