#include <bits/stdc++.h>
#define sd(a) scanf("%d",&a)
#define sld(a) scanf("%lld",&a)
#define mst(a,b) memset(a,b,sizeof a)
#define mp make_pair
#define all(a) a.begin(),a.end()
typedef long long ll;
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
const int maxn = 2e6 + 10;
const int maxm = 1e6 +  10;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const double eps = 1e-9;
char s[33][33];
int to[33][33][33][33];
bool vis[33][33];
vector<pii>v;
int n, m;

bool judge(int x, int y) {
    return 1 <= x && x <= n && 1 <= y && y <= m && s[x][y] == '1';
}

int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
void pre(int x, int y) {
    mst(vis, 0);
    vis[x][y] = 1;
    vector<pii>v;
    queue<pii>q;
    for(int i = 0; i < 4; ++i) {
        v.clear();
        int nx = x + dx[i], ny = y + dy[i];
        if(!judge(nx, ny))
            continue;
        q.push(mp(nx, ny));
        for(; !q.empty();) {
            pii p = q.front();
            q.pop();
            int ux = p.first;
            int uy = p.second;
            if(vis[ux][uy])
                continue;
            vis[ux][uy] = 1;
            v.pb(p);
            for(int j = 0; j < 4; ++j) {
                int qx = dx[j] + ux, qy = dy[j] + uy;
                if(judge(qx, qy) && !vis[qx][qy])
                    q.push(mp(qx, qy));
            }
        }
        int sz = v.size();
        for(int j = 0; j < sz; ++j) {
            int qx = v[j].first;
            int qy = v[j].second;
            to[x][y][qx][qy] = i;
        }
    }
}

int main() {
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif // local
//    int n,m;
    sd(n), sd(m);
    for(int i = 1; i <= n; ++i)
        scanf("%s", s[i] + 1);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j) {
            if(s[i][j] - '0')
                v.pb(mp(i, j));
            pre(i, j);
        }
    vector<int>q;
    int sz = v.size();
    char ch[] = {'D', 'R', 'U', 'L'};
    for(;;) {
        int idx1 = 0, idx2 = -1;
        for(int i = 1; i < sz; ++i) {
            if(v[i] != v[idx1]) {
                idx2 = i;
                break;
            }
        }
        if(idx2 == -1)
            break;
        for(; v[idx1] != v[idx2];) {
            int x1 = v[idx1].first, x2 = v[idx2].first;
            int y1 = v[idx1].second, y2 = v[idx2].second;
            int id = to[x1][y1][x2][y2];
            q.pb(id);
            for(int i = 0; i < sz; ++i) {
                if(judge(v[i].first + dx[id], v[i].second + dy[id]))
                    v[i].first += dx[id], v[i].second += dy[id];
            }
        }
    }
    for(int i = 0, z = q.size(); i < z; ++i) {
        int id = q[i];
        putchar(ch[id]);
    }
    return 0;
}