#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int dx[] = { 1, 0, -1, 0 };
const int dy[] = { 0, 1, 0, -1 };
const string dir = "DRUL";

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }

    vector<vector<int>> E(n * m);

    auto change = [&](int x, int y) {
        return x * m + y;
    };
    auto get = [&](int p) {
        return pair(p / m, p % m);
    };

    int sx = -1, sy = -1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (s[i][j] == '1') {
                sx = i, sy = j;
            }
        }
    }

    vector vis(n, vector<int>(m));
    string path;
    if (sx != -1) {
        auto dfs = [&](auto&& self, int x, int y) -> void {
            //cerr << "dfs " << x << " " << y << endl;
            for (int i = 0; i < 4; i++) {
                auto [nx, ny] = pair(x + dx[i], y + dy[i]);
                if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;
                if (s[nx][ny] == '0') continue;
                if (vis[nx][ny]) continue;
                vis[nx][ny] = 1;
                path += dir[i];
                self(self, nx, ny);
                path += dir[(i + 2) % 4];
            }
        };
        vis[sx][sy] = 1;
        dfs(dfs, sx, sy);
    }
    cout << path << endl;

    return 0;
}