2. Robot Program
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

At the robotics club, there is a testing ground for the robots being assembled. The testing ground is a square table with a grid field of size $$$8 \times 8$$$ cells. The bottom right cell is the finish line. Some cells contain obstacles. The map of the testing ground looks like this (the symbol '.' represents an empty cell, the symbol '#' represents a cell with an obstacle):


........
.###..#.
.#.##.#.
.#.#..#.
.#.#.##.
.#....#.
.######.
.#......

The program for the robot consists of a sequence of commands separated by a space. Each command is made up of two characters — a letter and a number, where the letter indicates the direction of movement (L — left, R — right, U — up, D — down), and the number from 1 to 7 indicates the number of steps. For example, the program R2 D7 means to first make 2 steps to the right, then 7 steps down.

If the robot encounters an obstacle or the edge of the field while executing a command, it moves on to the next command. As soon as the robot reaches the finish cell, the execution of the program stops.

Your task is to come up with the shortest possible program for the robot so that, starting from any empty cell, the robot always reaches the finish cell. For example, the program R2 D7 does not meet this requirement: with it, the robot reaches the finish cell only from the last three cells of the first and last rows and from any cell of the last column.

To submit a solution in the Codeforces system, click the "Submit code" link (above the problem statement). In the "Source code" field, write your program, do not write anything extra. In the "Language" field, select PHP.

Scoring

A solution in which the program contains the smallest possible number of commands, and the robot reaches the finish from any empty cell, will receive 100 points. For each extra command, 9 points are subtracted. For each cell from which the robot does not reach the finish, 11 points are subtracted. However, the total score cannot be negative. The final score is communicated to the participant.

During the competition, participants had 10 attempts to submit a solution. There is no such restriction on Codeforces.