Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Vladik and Favorite Game

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThis is an interactive problem.

Vladik has favorite game, in which he plays all his free time.

Game field could be represented as *n* × *m* matrix which consists of cells of three types:

- «.» — normal cell, player can visit it.
- «F» — finish cell, player has to finish his way there to win. There is exactly one cell of this type.
- «*» — dangerous cell, if player comes to this cell, he loses.

Initially player is located in the left top cell with coordinates (1, 1).

Player has access to 4 buttons "U", "D", "L", "R", each of them move player up, down, left and right directions respectively.

But it’s not that easy! Sometimes friends play game and change functions of buttons. Function of buttons "L" and "R" could have been swapped, also functions of buttons "U" and "D" could have been swapped. Note that functions of buttons can be changed only at the beginning of the game.

Help Vladik win the game!

Input

First line contains two space-separated integers *n* and *m* (1 ≤ *n*, *m* ≤ 100) — number of rows and columns respectively.

Each of next *n* lines contains *m* characters describing corresponding row of field. Set of characters in field is described above.

Guaranteed that cell with coordinates (1, 1) is normal and there is at least one way from initial cell to finish cell without dangerous cells.

Interaction

You can press buttons no more than 2·*n*·*m* times.

To press a button you should print "U", "D", "L", "R" in new line. It’s necessary to print newline character and flush output. After flushing buffer you should read answer from input data. Answer is the pair of space-separated integers *x*, *y* — new position of player. In case, if there is no cell in direction of moving, position will not change. If after any move player lost, in other words player move to dangerous cell, then *x* and *y* will be equal to - 1.

If after any move player is in finish or dangerous cell, then you should terminate your program.

To finish output buffer (i. e. for operation flush) right after printing direction and newline you should do next:

- fflush(stdout) in C++
- System.out.flush() in Java
- stdout.flush() in Python
- flush(output) in Pascal
- read documentation for other languages.

Hacks

To perform a hack you should use this format:

n m swapLR swapUD

a_1

a_2

...

a_n

Where *n*, *m* — number of rows and columns in game field. *swapLR* is equal to 1 in case, when directions "L’’ and "R’’ is swapped, and equal to 0 otherwise. *swapUD* is equal to 1, when directions "U’’ and "D’’ is swapped, and equal to 0 otherwise. *a*_{1}, *a*_{2}, ..., *a*_{n} — description of corresponding rows of game field.

Example

Input

4 3

...

**.

F*.

...

1 1

1 2

1 3

1 3

2 3

3 3

4 3

4 2

4 1

3 1

Output

R

L

L

D

U

U

U

R

R

D

Note

In first test case all four directions swapped with their opposite directions. Protocol of interaction In more convenient form:

This test could be presenter for hack in following way:

4 3 1 1

...

**.

F*.

...

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/25/2022 07:36:11 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|