{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"In the Indian temple the floor has rectangular form filled with identical square tiles $1 \\times 1$. Each tile contains from $0$ to $k~(k \\le 30000)$ corns. A mouse runs out from a left lower corner and go to the exit in right upper corner.\r\n\r\nMouse can go only right or forward, collecting all the corns from the tiles where it resides.\r\n\r\nFind the route, where mouse can take as much corn as possible.\r\n\r\n\u003cimg src\u003d\"https://static.e-olymp.com/content/f2/f2a5a7f2a5c442bdbd844f45d2181de9bfcf0ff6.gif\" /\u003e\r\n\r\n\u003ch2\u003eInput\u003c/h2\u003e\r\nThe first line contains $m$ and $n~(1 \\le m, n \\le 100)$ --- the floor size. Next we have $m$ lines, starting from top, each contains $n$ numbers --- the number of corns on the floor.\r\n\r\n\u003ch2\u003eOutput\u003c/h2\u003e\r\nPrint the route of the mouse in format: \u003cstrong\u003eRRFFFRF\u003c/strong\u003e (\u003cstrong\u003eF\u003c/strong\u003e --- step forward, \u003cstrong\u003eR\u003c/strong\u003e --- step right)."}},{"title":"Example","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2 3\r\n3 2 4\r\n1 5 1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eRFR\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}