Mouse and corns#15
In an Indian temple, the rectangular floor is covered with identical 1 \times 1 square tiles. Each tile contains from to (k \leq 30000) corns. The floor has dimensions m \times n. A mouse starts from the bottom-left corner of the floor and heads toward its hole in the diagonally opposite top-right corner. The mouse can move only to the right or forward (up), collecting all corns from the tile it steps onto.
Find a route that allows the mouse to collect as many corns as possible along its path.
The first line contains the dimensions of the floor and (1 \leq m, n \leq 100). Each of the following lines, starting from the top, contains integers indicating the number of corns on each tile in that row.
Print the route in the following format: RRFFFRF (F — one step forward (up), R — one step to the right).
Example 1