Problem: On the way to school, Karen became fixated on the puzzle game on her phone!

<image>

The game is played as follows. In each level, you have a grid with n rows and m columns. Each cell originally contains the number 0.

One move consists of choosing one row or column, and adding 1 to all of the cells in that row or column.

To win the level, after all the moves, the number in the cell at the i-th row and j-th column should be equal to gi, j.

Karen is stuck on one level, and wants to know a way to beat this level using the minimum number of moves. Please, help her with this task!

Input

The first line of input contains two integers, n and m (1 ≤ n, m ≤ 100), the number of rows and the number of columns in the grid, respectively.

The next n lines each contain m integers. In particular, the j-th integer in the i-th of these rows contains gi, j (0 ≤ gi, j ≤ 500).

Output

If there is an error and it is actually not possible to beat the level, output a single integer -1.

Otherwise, on the first line, output a single integer k, the minimum number of moves necessary to beat the level.

The next k lines should each contain one of the following, describing the moves in the order they must be done:

  * row x, (1 ≤ x ≤ n) describing a move of the form "choose the x-th row". 
  * col x, (1 ≤ x ≤ m) describing a move of the form "choose the x-th column". 



If there are multiple optimal solutions, output any one of them.

Examples

Input

3 5
2 2 2 3 2
0 0 0 1 0
1 1 1 2 1


Output

4
row 1
row 1
col 4
row 3


Input

3 3
0 0 0
0 1 0
0 0 0


Output

-1


Input

3 3
1 1 1
1 1 1
1 1 1


Output

3
row 1
row 2
row 3

Note

In the first test case, Karen has a grid with 3 rows and 5 columns. She can perform the following 4 moves to beat the level:

<image>

In the second test case, Karen has a grid with 3 rows and 3 columns. It is clear that it is impossible to beat the level; performing any move will create three 1s on the grid, but it is required to only have one 1 in the center.

In the third test case, Karen has a grid with 3 rows and 3 columns. She can perform the following 3 moves to beat the level:

<image>

Note that this is not the only solution; another solution, among others, is col 1, col 2, col 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
const int MAXN = 1e4 + 10;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const double pi = acos(-1.0);
const double eps = 1e-6;
int dx[] = {0, -1, 0, 1};
int dy[] = {1, 0, -1, 0};
int test;
int g[105][105], a[105][105];
int n, m;
vector<pair<string, int> > res, res2;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) scanf("%d", &g[i][j]), a[i][j] = g[i][j];
  for (int i = 1; i <= n; i++) {
    int mini = inf;
    for (int j = 1; j <= m; j++) mini = min(mini, g[i][j]);
    if (mini == 0) continue;
    for (int j = 1; j <= m; j++) g[i][j] -= mini;
    while (mini--) res.push_back(make_pair("row", i));
  }
  for (int j = 1; j <= m; j++) {
    int mini = inf;
    for (int i = 1; i <= n; i++) mini = min(mini, g[i][j]);
    if (mini == 0) continue;
    for (int i = 1; i <= n; i++) g[i][j] -= mini;
    while (mini--) res.push_back(make_pair("col", j));
  }
  for (int j = 1; j <= m; j++) {
    int mini = inf;
    for (int i = 1; i <= n; i++) mini = min(mini, a[i][j]);
    if (mini == 0) continue;
    for (int i = 1; i <= n; i++) a[i][j] -= mini;
    while (mini--) res2.push_back(make_pair("col", j));
  }
  for (int i = 1; i <= n; i++) {
    int mini = inf;
    for (int j = 1; j <= m; j++) mini = min(mini, a[i][j]);
    if (mini == 0) continue;
    for (int j = 1; j <= m; j++) a[i][j] -= mini;
    while (mini--) res2.push_back(make_pair("row", i));
  }
  bool checkg = true, checka = true;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      if (g[i][j]) checkg = false;
      if (a[i][j]) checka = false;
    }
  if (!checkg && !checka)
    cout << -1;
  else if (!checkg && checka) {
    cout << res2.size() << endl;
    for (int i = 0; i < res2.size(); i++)
      cout << res2[i].first << ' ' << res2[i].second << endl;
  } else if (checkg && !checka) {
    cout << res.size() << endl;
    for (int i = 0; i < res.size(); i++)
      cout << res[i].first << ' ' << res[i].second << endl;
  } else {
    if (res.size() < res2.size()) {
      cout << res.size() << endl;
      for (int i = 0; i < res.size(); i++)
        cout << res[i].first << ' ' << res[i].second << endl;
    } else {
      cout << res2.size() << endl;
      for (int i = 0; i < res2.size(); i++)
        cout << res2[i].first << ' ' << res2[i].second << endl;
    }
  }
  return 0;
}