#include <bits/stdc++.h>
using namespace std;
int n, m, board[20][20], dis[400][400];
void U()
{
    putchar('U');
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            if (board[i][j] == 1 && i > 0 && board[i - 1][j] != 2)
                board[i][j] = 0, board[i - 1][j] = 1;
}
void D()
{
    putchar('D');
    for (int i = n - 1; ~i; i--)
        for (int j = 0; j < m; j++)
            if (board[i][j] == 1 && i < n - 1 && board[i + 1][j] != 2)
                board[i][j] = 0, board[i + 1][j] = 1;
}
void L()
{
    putchar('L');
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            if (board[i][j] == 1 && j > 0 && board[i][j - 1] != 2)
                board[i][j] = 0, board[i][j - 1] = 1;
}
void R()
{
    putchar('R');
    for (int i = 0; i < n; i++)
        for (int j = m - 1; ~j; j--)
            if (board[i][j] == 1 && j < m - 1 && board[i][j + 1] != 2)
                board[i][j] = 0, board[i][j + 1] = 1;
}
inline int get(int s)
{
    return board[s / m][s % m];
}
void dfs(int rt, int s, int fa)
{
    if (rt != s)
        dis[rt][s] = dis[rt][fa] + 1;
    if (s % m != 0 && s - 1 != fa && get(s - 1) != 2)
        dfs(rt, s - 1, s);
    if (s % m != m - 1 && s + 1 != fa && get(s + 1) != 2)
        dfs(rt, s + 1, s);
    if (s / m != 0 && s - m != fa && get(s - m) != 2)
        dfs(rt, s - m, s);
    if (s / m != n - 1 && s + m != fa && get(s + m) != 2)
        dfs(rt, s + m, s);
}
bool Find(int &x, int &y)
{
    vector<int> v;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (board[i][j] == 1)
                v.push_back(i * m + j);
        }
    }
    if (v.size() <= 1)
        return 0;
    x = v[0], y = v[1];
    return 1;
}
void meet(int x, int y)
{
    while (x != y)
    {
        if (y % m != 0 && get(y - 1) != 2 && dis[x][y] > dis[x][y - 1])
        {
            y--;
            L();
            if (x % m != 0 && get(x - 1) != 2)
                x--;
        }
        if (y % m != m - 1 && get(y + 1) != 2 && dis[x][y] > dis[x][y + 1])
        {
            y++;
            R();
            if (x % m != m - 1 && get(x + 1) != 2)
                x++;
        }
        if (y / m != 0 && get(y - m) != 2 && dis[x][y] > dis[x][y - m])
        {
            y -= m;
            U();
            if (x / m != 0 && get(x - m) != 2)
                x -= m;
        }
        if (y / m != n - 1 && get(y + m) != 2 && dis[x][y] > dis[x][y + m])
        {
            y += m;
            D();
            if (x / m != n - 1 && get(x + m) != 2)
                x += m;
        }
    }
}
int main()
{
    scanf("%d%d\n", &n, &m);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            board[i][j] = 50 - getchar();
        }
        getchar();
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (board[i][j] == 1)
                dfs(i * m + j, i * m + j, -1);
        }
    }
    int x, y;
    while (Find(x, y))
    {
        meet(x, y);
    }
}