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;
long long ar[200][200];
long long n, k, q, i, ans, a, b, j, m, cat;
struct meow {
  long long x;
  long long y;
  bool z;
};
void printt() {
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      cout << ar[i][j] << " ";
    }
    cout << endl;
  }
}
bool kucing() {
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (ar[i][j] != 0) return true;
    }
  }
  return false;
}
int main() {
  cin >> n >> m;
  long long row[n + 5];
  long long col[m + 5];
  meow haha[60000];
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      cin >> ar[i][j];
    }
  }
  if (n < m) {
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        if (j == 1) row[i] = ar[i][j];
        row[i] = min(row[i], ar[i][j]);
      }
    }
    bool can = false;
    cat = 0;
    for (i = 1; i <= n; i++) {
      can = false;
      for (j = 1; j <= m; j++) {
        if (ar[i][j] == 0 or ar[i][j] < row[i]) can = true;
      }
      if (can == false) {
        meow tmp;
        tmp.x = i;
        tmp.y = row[i];
        tmp.z = true;
        haha[cat] = tmp;
        cat += 1;
        ans += tmp.y;
        for (j = 1; j <= m; j++) ar[i][j] -= row[i];
      }
    }
    for (j = 1; j <= m; j++) {
      for (i = 1; i <= n; i++) {
        if (i == 1) col[j] = ar[i][j];
        col[j] = min(col[j], ar[i][j]);
      }
    }
    for (j = 1; j <= m; j++) {
      can = false;
      for (i = 1; i <= n; i++) {
        if (ar[i][j] == 0 or ar[i][j] < col[j]) can = true;
      }
      if (can == false) {
        meow tmp;
        tmp.x = j;
        tmp.y = col[j];
        tmp.z = false;
        haha[cat] = tmp;
        cat += 1;
        ans += tmp.y;
        for (i = 1; i <= n; i++) ar[i][j] -= col[j];
      }
    }
  } else {
    bool can = false;
    cat = 0;
    for (j = 1; j <= m; j++) {
      for (i = 1; i <= n; i++) {
        if (i == 1) col[j] = ar[i][j];
        col[j] = min(col[j], ar[i][j]);
      }
    }
    for (j = 1; j <= m; j++) {
      can = false;
      for (i = 1; i <= n; i++) {
        if (ar[i][j] == 0 or ar[i][j] < col[j]) can = true;
      }
      if (can == false) {
        meow tmp;
        tmp.x = j;
        tmp.y = col[j];
        tmp.z = false;
        haha[cat] = tmp;
        cat += 1;
        ans += tmp.y;
        for (i = 1; i <= n; i++) ar[i][j] -= col[j];
      }
    }
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        if (j == 1) row[i] = ar[i][j];
        row[i] = min(row[i], ar[i][j]);
      }
    }
    for (i = 1; i <= n; i++) {
      can = false;
      for (j = 1; j <= m; j++) {
        if (ar[i][j] == 0 or ar[i][j] < row[i]) can = true;
      }
      if (can == false) {
        meow tmp;
        tmp.x = i;
        tmp.y = row[i];
        tmp.z = true;
        haha[cat] = tmp;
        cat += 1;
        ans += tmp.y;
        for (j = 1; j <= m; j++) ar[i][j] -= row[i];
      }
    }
  }
  if (kucing()) {
    cout << "-1" << endl;
    return 0;
  }
  cout << ans << endl;
  for (i = 0; i < cat; i++) {
    if (haha[i].z == true) {
      for (j = 0; j < haha[i].y; j++) {
        cout << "row " << haha[i].x << endl;
      }
    } else {
      for (j = 0; j < haha[i].y; j++) {
        cout << "col " << haha[i].x << endl;
      }
    }
  }
}