# C# – CodeForces – Karen and Game

Karen and Game is the third article about Karen. In a row. Pretty much, someone in CodeForces has created 7 different problems with her, thus the Japanese lady is getting famous. This time the problem looks like this:

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.

And the solution has costed me really a lot of time. Mainly because I was naive and I was thinking that concatenating a string and printing it as an answer is faster than simply iterating through a list with the answers. Theoretically, we print the string once and with the list it could be up to 500 times. Still, 500 times printing from a list was faster (see the commented lines in the solution).

What is the solution about? Pretty much, it is not that difficult – we check what do we have more – columns or rows. If we have more columns, it’s obvious that we would like to switch rows first. And vice versa. Then we check the minimal value in the line. If it is not zero, we decrement the values of the line with it. At the end we check the sum of the whole matrix. If it is zero, we print the values in the liResult. And that’s it. We have a matrix, which makes it easy to iterate columns and rows. Initially I was trying with list of lists, but the iteration process was a bit overcomplicated.

Yup, that’s all! Cheers! 🙂

Tagged with: , ,