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;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void soln();
signed main() {
  int t = 1;
  while (t--) soln();
  return 0;
}
int a[110][110];
void soln() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < (int)(n); ++i)
    for (int j = 0; j < (int)(m); ++j) cin >> a[i][j];
  int steps = 0;
  queue<tuple<string, int, int>> st;
  bool fail = false;
  if (n < m) {
    for (int i = 0; i < (int)(n); ++i) {
      int mn = 1e9;
      for (int j = 0; j < (int)(m); ++j) {
        mn = min(mn, a[i][j]);
      }
      for (int j = 0; j < (int)(m); ++j) {
        a[i][j] -= mn;
      }
      steps += mn;
      st.push({"row", i, mn});
    }
    for (int j = 0; j < (int)(m); ++j) {
      bool all_same = true;
      for (int i = 0; i < (int)(n); ++i) {
        all_same &= (a[i][j] == a[0][j]);
      }
      if (!all_same) {
        fail = true;
      } else {
        steps += a[0][j];
        st.push({"col", j, a[0][j]});
      }
    }
  } else {
    for (int j = 0; j < (int)(m); ++j) {
      int mn = 1e9;
      for (int i = 0; i < (int)(n); ++i) {
        mn = min(mn, a[i][j]);
      }
      for (int i = 0; i < (int)(n); ++i) {
        a[i][j] -= mn;
      }
      steps += mn;
      st.push({"col", j, mn});
    }
    for (int i = 0; i < (int)(n); ++i) {
      bool all_same = true;
      for (int j = 0; j < (int)(m); ++j) {
        all_same &= (a[i][j] == a[i][0]);
      }
      if (!all_same) {
        fail = true;
      } else {
        steps += a[i][0];
        st.push({"row", i, a[i][0]});
      }
    }
  }
  if (fail) {
    cout << -1 << "\n";
  } else {
    cout << steps << "\n";
    while (!st.empty()) {
      auto [str, idx, tim] = st.front();
      st.pop();
      for (int i = 0; i < (int)(tim); ++i)
        cout << str << " " << idx + 1 << "\n";
    }
  }
}