#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
int main() {
  int r, c;
  cin >> r >> c;
  int i, j;
  int m[105][105];
  int y[105][105];
  memset(y, 0, sizeof(y));
  for (i = 1; i <= r; i++) {
    for (j = 1; j <= c; j++) {
      cin >> m[i][j];
    }
  }
  int ri[105];
  int ra[105];
  int ci[105];
  int ca[105];
  for (i = 1; i <= r; i++) {
    ri[i] = m[i][1];
    ra[i] = m[i][1];
    for (j = 1; j <= c; j++) {
      ri[i] = ((ri[i]) < (m[i][j]) ? (ri[i]) : (m[i][j]));
      ra[i] = ((ra[i]) > (m[i][j]) ? (ra[i]) : (m[i][j]));
    }
  }
  for (i = 1; i <= c; i++) {
    ci[i] = m[1][i];
    ca[i] = m[1][i];
    for (j = 1; j <= r; j++) {
      ci[i] = ((ci[i]) < (m[j][i]) ? (ci[i]) : (m[j][i]));
      ca[i] = ((ca[i]) > (m[j][i]) ? (ca[i]) : (m[j][i]));
    }
  }
  if (r <= c) {
    vector<pair<string, int> > v;
    int ans = -1;
    int cnt = 0;
    int k;
    for (i = 1; i <= r; i++) {
      cnt = cnt + ri[i];
      string s = "row";
      for (k = 1; k <= ri[i]; k++) {
        v.push_back(make_pair(s, i));
      }
    }
    for (i = 1; i <= r; i++) {
      for (j = 1; j <= c; j++) {
        y[i][j] = y[i][j] + ri[i];
      }
    }
    for (j = 1; j <= c; j++) {
      int w = 0;
      for (i = 1; i <= r; i++) {
        w = ((0) > (m[i][j] - y[i][j]) ? (0) : (m[i][j] - y[i][j]));
      }
      cnt = cnt + w;
      string s1 = "col";
      for (k = 1; k <= w; k++) {
        v.push_back(make_pair(s1, j));
      }
      for (i = 1; i <= r; i++) {
        y[i][j] = y[i][j] + w;
      }
    }
    int f = 0;
    for (i = 1; i <= r; i++) {
      for (j = 1; j <= c; j++) {
        if (m[i][j] != y[i][j]) f = 1;
      }
    }
    if (f == 0) {
      ans = cnt;
      cout << ans << "\n";
      for (i = 0; i < v.size(); i++) {
        cout << v[i].first << " " << v[i].second << "\n";
      }
    } else {
      ans = -1;
      cout << ans << "\n";
    }
  } else if (r > c) {
    vector<pair<string, int> > v;
    int ans = -1;
    int cnt = 0;
    int k;
    for (i = 1; i <= c; i++) {
      cnt = cnt + ci[i];
      string s = "col";
      for (k = 1; k <= ci[i]; k++) {
        v.push_back(make_pair(s, i));
      }
    }
    for (i = 1; i <= c; i++) {
      for (j = 1; j <= r; j++) {
        y[j][i] = y[j][i] + ci[i];
      }
    }
    for (j = 1; j <= r; j++) {
      int w = 0;
      for (i = 1; i <= c; i++) {
        w = ((0) > (m[j][i] - y[j][i]) ? (0) : (m[j][i] - y[j][i]));
      }
      cnt = cnt + w;
      string s1 = "row";
      for (k = 1; k <= w; k++) {
        v.push_back(make_pair(s1, j));
      }
      for (i = 1; i <= c; i++) {
        y[j][i] = y[j][i] + w;
      }
    }
    int f = 0;
    for (i = 1; i <= r; i++) {
      for (j = 1; j <= c; j++) {
        if (m[i][j] != y[i][j]) f = 1;
      }
    }
    if (f == 0) {
      ans = cnt;
      cout << ans << "\n";
      for (i = 0; i < v.size(); i++) {
        cout << v[i].first << " " << v[i].second << "\n";
      }
    } else {
      ans = -1;
      cout << ans << "\n";
    }
  }
  return 0;
}
