Sign Flip Table

In a new one-player math game called Number Table, a table with $n$ rows and $m$ columns is filled with integers. In one move, the player picks one row or one column and flips the sign of every number in that row or column.

The goal is to bring the table to a state where the sum of the numbers in every row and every column is non-negative. The number of moves does not need to be minimal, but at most 20000 moves may be made.

Your task is to write a program that, given the initial table, finds a sequence of moves that reaches the goal, or determines that the goal cannot be reached.

The first line contains two integers $n$ and $m$ ($2 \le n, m \le 100$). Each of the next $n$ lines contains $m$ integers $a_{i,j}$ ($|a_{i,j}| \le 100$).

In the first line, print $k$, the number of moves, or -1 if the goal cannot be reached. If the goal can be reached, print the $k$ moves in the following $k$ lines, one move per line. Each line contains the move type (R if a row is chosen, C if a column is chosen) and the number of that row or column. Rows and columns are numbered from 1, rows from top to bottom and columns from left to right.

The printed sequence must contain at most 20000 moves. It is guaranteed that if a sequence of moves reaching the goal exists, then a sequence satisfying this limit also exists.