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

int n,m,i,j,t;
int a[22][22];//0:wall 1:empty 2:kangroo
int vis[22][22];
int s[486],p,x,y;
bool check(){
    int r=0;
    for(i=1;i<=n;++i)
    for(j=1;j<=m;++j)if(a[i][j]==2)++r;
    if(r==1)return 0;
    return 1;
}
void play(int w){
    int i,j;
    bool b;
    if(w==0){//up
        putchar('U');
        for(i=1;i<=m;++i){
            b=0;//if came
            for(j=n;j;--j){
                if(a[j][i]==1){
                    if(b)a[j][i]=2;
                    b=0;
                }else if(a[j][i]==2){
                    if(b)a[j][i]=2;
                    else if(a[j-1][i])a[j][i]=1;
                    b=1;
                }else b=0;
            }
        }
    }
    if(w==1){//down
        putchar('D');
        for(i=1;i<=m;++i){
            b=0;//if came
            for(j=1;j<=n;++j){
                if(a[j][i]==1){
                    if(b)a[j][i]=2;
                    b=0;
                }else if(a[j][i]==2){
                    if(b)a[j][i]=2;
                    else if(a[j+1][i])a[j][i]=1;
                    b=1;
                }else b=0;
            }
        }
    }
    if(w==2){//left
        putchar('L');
        for(i=1;i<=n;++i){
            b=0;//if came
            for(j=m;j;--j){
                if(a[i][j]==1){
                    if(b)a[i][j]=2;
                    b=0;
                }else if(a[i][j]==2){
                    if(b)a[i][j]=2;
                    else if(a[i][j-1])a[i][j]=1;
                    b=1;
                }else b=0;
            }
        }
    }
    if(w==3){//right
        putchar('R');
        for(i=1;i<=n;++i){
            b=0;//if came
            for(j=1;j<=m;++j){
                if(a[i][j]==1){
                    if(b)a[i][j]=2;
                    b=0;
                }else if(a[i][j]==2){
                    if(b)a[i][j]=2;
                    else if(a[i][j+1])a[i][j]=1;
                    b=1;
                }else b=0;
            }
        }
    }
}
bool K=0;
bool dfs(int i,int j){
    if(vis[i][j])return 0;
    vis[i][j]=1;
    if(!a[i][j])return 0;
    if(a[i][j]==2&&K){x=i,y=j;return 1;}
    K=1;
    s[p++]=0;
    if(dfs(i-1,j))return 1;
    --p;
    s[p++]=1;
    if(dfs(i+1,j))return 1;
    --p;
    s[p++]=2;
    if(dfs(i,j-1))return 1;
    --p;
    s[p++]=3;
    if(dfs(i,j+1))return 1;
    --p;
    return 0;
}
void pt(){
    for(int i=1;i<=n;++i,puts(""))
    for(int j=1;j<=m;++j)printf("%d ",a[i][j]);
    puts("");
}
int main()
{
    scanf("%d%d",&n,&m);
    for(i=0;i<=n+1;++i)
    for(j=0;j<=m+1;++j)a[i][j]=0;
    char c=0;
    for(i=1;i<=n;++i)
    for(j=1;j<=m;++j){
        while(c=getchar(),c!='0'&&c!='1');
        if(c=='1')a[i][j]=2;
        else a[i][j]=0;
    }
    while(check()){
        for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)vis[i][j]=0;
        for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)if(a[i][j]==2)goto end;
        end:;
        p=0;
        K=0;
        dfs(i,j);
        int l=0;
        while(l<p){
            if(s[l]==0&&a[x-1][y])--x,s[p++]=s[l];
            if(s[l]==1&&a[x+1][y])++x,s[p++]=s[l];
            if(s[l]==2&&a[x][y-1])--y,s[p++]=s[l];
            if(s[l]==3&&a[x][y+1])++y,s[p++]=s[l];
            if(p>l+2&&(s[p-1]^s[p-2]==1))p-=2;
            play(s[l++]);
        }
    }return 0;
}