#include <bits/stdc++.h>
using namespace std;
constexpr int dx[] = {0, 1, 0, -1};
constexpr int dy[] = {1, 0, -1, 0};
int n, m;
int a[30][30], vis[30][30], c[30][30];
int aa[30][30];
vector<int> ans, vec;
bool dfs(int x, int y, int tx, int ty) {
    vis[x][y] = 1;
    if (x == tx && y == ty) {
        return true;
    }

    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx < 1 || nx > n || ny < 1 || ny > m || vis[nx][ny] || !aa[nx][ny]) {
            continue;
        }
        
        ans.push_back(i);
        vec.push_back(i);
        if (dfs(nx, ny, tx, ty)) {
            return true;
        }
    }

    vec.pop_back();
    ans.pop_back();
    vis[x][y] = 0;
    return false;
}

inline void step(int x, int y, int k) {
    int nx = x + dx[vec[k]];
    int ny = y + dy[vec[k]];
    if (nx > 0 && nx <= n && ny > 0 && ny <= m && a[nx][ny] != -1) {
        c[nx][ny] += a[x][y];
        a[x][y] = 0;
    }
}
inline void work(int sx, int sy, int tx, int ty) {
    memset(vis, 0, sizeof(vis));
    vec.clear();
    vis[sx][sy] = 1;
    dfs(sx, sy, tx, ty);
    for (int k = 0; k < vec.size(); k++) {
        memset(c, 0, sizeof(c));
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (a[i][j] > 0) {
                    step(i, j, k);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                a[i][j] += c[i][j];
            }
        }
    }
}

int main(){
    cin.tie(0)->ios::sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            char c;
            cin >> c;
            a[i][j] = c == '1' ? 1 : -1;
            aa[i][j] = c == '1';
        }
    }

    while (true) {
        int flag = 0;
        int sx = 0, sy = 0, tx = 0, ty = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (a[i][j] > 0) {
                    if(flag) tx = i, ty = j;
                    else sx = i, sy = j;
                    flag += 1;
                }
                if(flag == 2) break;
            }
            // cout << sx << " " << sy << " " << tx << " " << ty << endl;
            if (flag == 2) break;
        }
        
        if (flag == 2) {
            work(sx, sy, tx, ty);
        }

        int cnt = 0;
        for (int i = 1; i <= n; i++) {
            for(int j = 1; j <= m; j++){
                if(a[i][j] > 0) cnt += 1;
            }
        }
        if (cnt <= 1) break;
    }
    
    for (auto i : ans) {
        switch (i) {
            case 0: cout << "R"; break;
            case 1: cout << "D"; break;
            case 2: cout << "L"; break;
            case 3: cout << "U"; break;
            default: assert(0); break;
        }
    }
    return 0;
}