Problem: This 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. a1, a2, ..., an — 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:

<image>

This test could be presenter for hack in following way: 
    
    
      
    4 3 1 1  
    ...  
    **.  
    F*.  
    ...  
    

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.Collection;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Queue;
import java.util.ArrayDeque;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Fedor Poschmann(fedor.poschmann@gmail.com)
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            char dirL = 'L';
            char dirR = 'R';
            char dirU = 'U';
            char dirD = 'D';

            int n = in.readInt();
            int m = in.readInt();
            char[][] board = new char[n][];
            for (int i = 0; i < n; i++) {
                board[i] = in.readString().toCharArray();
            }
            int[][] steps = new int[n][m];

            int step = 0;
            Queue<TaskD.Node> dq = new ArrayDeque<>();
            TaskD.Node finish = findF(board, n, m);
            dq.add(finish);
            while (!dq.isEmpty()) {
                step++;
                Queue<TaskD.Node> currQ = new ArrayDeque<>();
                for (TaskD.Node node : dq) {
                    if (steps[node.y][node.x] == 0) {
                        steps[node.y][node.x] = step;
                        currQ.addAll(getNeightbours(board, node, n, m));
                    }
                }
                dq = currQ;
            }

            // dbg
//        for (int i = 0; i < n; i++) {
//            out.printLine(steps[i]);
//        }

            int cX = 0;
            int cY = 0;
            boolean hor = false;
            boolean vert = false;

            // make step
            while (cX != finish.x || cY != finish.y) {
                if (board[cY][cX] == '*') {
                    out.print(-1);
                    return;
                }
                if (!hor) {
                    // try to find hor real dir
                    if (cX == 0 && board[cY][cX + 1] != '*') {
                        out.printLine(dirR);
                        out.flush();
                        int y = in.readInt() - 1;
                        int x = in.readInt() - 1;
                        if (x == cX) {
                            // change dir
                            char tmp = dirL;
                            dirL = dirR;
                            dirR = tmp;
                        }
                        cX = x;
                        cY = y;
                        hor = true;
                        continue;
                    }
                    if (cX == m - 1 && board[cY][cX - 1] != '*') {
                        out.printLine(dirL);
                        out.flush();
                        int y = in.readInt() - 1;
                        int x = in.readInt() - 1;
                        if (x == cX) {
                            // change dir
                            char tmp = dirL;
                            dirL = dirR;
                            dirR = tmp;
                        }
                        cX = x;
                        cY = y;
                        hor = true;
                        continue;
                    }
                }
                if (!vert) {
                    // try to find ver real dir
                    if (cY == 0 && board[cY + 1][cX] != '*') {
                        out.printLine(dirD);
                        out.flush();
                        int y = in.readInt() - 1;
                        int x = in.readInt() - 1;
                        if (y == cY) {
                            // change dir
                            char tmp = dirU;
                            dirU = dirD;
                            dirD = tmp;
                        }
                        cX = x;
                        cY = y;
                        vert = true;
                        continue;
                    }
                    if (cY == n - 1 && board[cY - 1][cX] != '*') {
                        out.printLine(dirU);
                        out.flush();
                        int y = in.readInt() - 1;
                        int x = in.readInt() - 1;
                        if (y == cY) {
                            // change dir
                            char tmp = dirU;
                            dirU = dirD;
                            dirD = tmp;
                        }
                        cX = x;
                        cY = y;
                        vert = true;
                        continue;
                    }
                }

                ArrayList<TaskD.Node> nnode = getNeightbours(board, new TaskD.Node(cY, cX), n, m);
                TaskD.Node next = null;
                for (TaskD.Node node : nnode) {
                    if (steps[cY][cX] > steps[node.y][node.x]) {
                        if (cX != node.x && hor) {
                            next = node;
                        } else if (cY != node.y && vert) {
                            next = node;
                        }
                    }
                }

                if (next.x > cX) {
                    out.printLine(dirR);
                }
                if (next.x < cX) {
                    out.printLine(dirL);
                }
                if (next.y > cY) {
                    out.printLine(dirD);
                }
                if (next.y < cY) {
                    out.printLine(dirU);
                }
                out.flush();
                cY = in.readInt() - 1;
                cX = in.readInt() - 1;

            }


            // try to find directions


        }

        private ArrayList<TaskD.Node> getNeightbours(char[][] board, TaskD.Node node, int n, int m) {
            int y = node.y;
            int x = node.x;
            ArrayList<TaskD.Node> res = new ArrayList<>();
            if (y > 0 && (board[y - 1][x] != '*')) {
                res.add(new TaskD.Node(y - 1, x));
            }
            if (y < n - 1 && (board[y + 1][x] != '*')) {
                res.add(new TaskD.Node(y + 1, x));
            }
            if (x > 0 && (board[y][x - 1] != '*')) {
                res.add(new TaskD.Node(y, x - 1));
            }
            if (x < m - 1 && (board[y][x + 1] != '*')) {
                res.add(new TaskD.Node(y, x + 1));
            }
            return res;
        }

        private TaskD.Node findF(char[][] board, int n, int m) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    if (board[i][j] == 'F') {
                        return new TaskD.Node(i, j);
                    }
                }
            }
            return null;
        }

        static class Node {
            int y;
            int x;

            public Node(int y, int x) {
                this.x = x;
                this.y = y;
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                if (Character.isValidCodePoint(c)) {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void printLine(char i) {
            writer.println(i);
        }

        public void close() {
            writer.close();
        }

        public void flush() {
            writer.flush();
        }

        public void print(int i) {
            writer.print(i);
        }

    }
}