#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;

const int maxn = 60;
char mp[maxn][maxn];
int vis[maxn][maxn] = {0};
int dir[4][2] = {
    {1,0}, {0, -1}, {0,1}, {-1,0}};
char dirc[4] = {'D', 'L', 'R', 'U'};
int n, m;

struct node{
    int x, y, step;
    string s;
    node(int xx, int yy, int sstep, string ss){
        x = xx;
        y = yy;
        step = sstep;
        s = ss;
    }
};

queue<node> q;

bool check(int x, int y){
    if(x < 0 || x >= n || y < 0 || y >= m || vis[x][y] == 1 || mp[x][y] == '1'){
        return false;
    }
    return true;
}

void bfs(int x, int y){
    q.push(node(x, y, 0, ""));
    vis[x][y] = 1;
    while(!q.empty()){
        node now = q.front();
        if(now.x == n - 1 && now.y == m - 1){
            cout << now.s << endl;
            cout << now.step << endl;
            break;
        }
        q.pop();
        for(int i = 0;i < 4;i++){
            int nx = now.x + dir[i][0];
            int ny = now.y + dir[i][1];
            if(check(nx, ny)){
                q.push(node(nx, ny, now.step + 1, now.s + dirc[i]));
                vis[nx][ny] = 1;
            }
        }
    }
}

int main(){
    #ifdef ONLINE_JUDGE
    #else
    freopen("input.txt", "r", stdin);
    #endif //ONLINE_JUDGE

    cin >> n >> m;
    for(int i = 0;i < n;i++){
        cin >> mp[i];
    }
    bfs(0, 0);
    return 0;
}