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.
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class KarenAndGame implements Closeable {

    private InputReader in = new InputReader(System.in);
    private PrintWriter out = new PrintWriter(System.out);
    
    public void solve() {
        String ROW = "row", COL = "col";
        int n = in.ni(), m = in.ni();
        int[][] x = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                x[i][j] = in.ni();
            }
        }
        if (n > m) {
            String t = ROW;
            ROW = COL;
            COL = t;
            x = rotate(x);
            int k = n;
            n = m;
            m = k;
        }
        List<String> log = new ArrayList<>();
        int[] min = new int[n];
        Arrays.fill(min, 1000);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                min[i] = Math.min(min[i], x[i][j]);  
            }   
        }
        int[][] result = new int[n][m];
        for (int i = 0; i < n; i++) {
            int cnt = min[i];
            for (int j = 0; j < cnt; j++) {
                log.add(ROW + " " + (i + 1));
            }
            Arrays.fill(result[i], cnt);
        }
        for (int j = 0; j < m; j++) {
            for (int i = 0; i < n; i++) {
                if (result[i][j] < x[i][j]) {
                    int diff = x[i][j] - result[i][j];
                    for (int k = 0; k < diff; k++) {
                        log.add(COL + " " + (j + 1));
                    }
                    for (int k = 0; k < diff; k++) {
                        for (int row = 0; row < n; row++) {
                            result[row][j]++;
                        }
                    }
                } else if (result[i][j] > x[i][j]) {
                    out.println(-1);
                    return;
                }
            }
        }
        if (verify(result, x)) {
            out.println(log.size());
            log.forEach(out::println);
        } else {
            out.println(-1);
        }
    }
    
    private boolean verify(int[][] given, int[][] expected) {
        int n = given.length, m = given[0].length;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (given[i][j] != expected[i][j]) {
                    return false;
                }
            }
        }
        return true;
    }
    
    private int[][] rotate(int[][] x) {
        int n = x.length, m = x[0].length;
        int[][] result = new int[m][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                result[j][i] = x[i][j];
            }
        }
        return result;
    }

    @Override
    public void close() throws IOException {
        in.close();
        out.close();
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int ni() {
            return Integer.parseInt(next());
        }

        public long nl() {
            return Long.parseLong(next());
        }

        public void close() throws IOException {
            reader.close();
        }
    }

    public static void main(String[] args) throws IOException {
        try (KarenAndGame instance = new KarenAndGame()) {
            instance.solve();
        }
    }
}
