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

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int N=505,dx[4]={0,0,-1,1},dy[4]={-1,1,0,0};
const string mv="LRUD";

int n,m,k,l,r,dis[2][N][N],par[2][N][N];
bool vis[N][N];
string a[N];

bool valid(int i, int j){return i>=0&&i<n&&j>=0&&j<m&&a[i][j]=='.';}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m >> k >> l >> r; l--,r--;
    if((l+r)%2==0||(n+m+k)%2){
        cout << "No\n";
        return 0;
    }
    for(int i=0; i<n; ++i) cin >> a[i];
    memset(dis,0x3f,sizeof dis);
    for(int _=0; _<2; ++_){
        int x0,y0;
        if(_==0) x0=y0=0;
        else x0=n-1,y0=m-1;
        queue<pii> q;
        memset(vis,0,sizeof vis);
        q.push({x0,y0}),dis[_][x0][y0]=0,vis[x0][y0]=1,par[_][x0][y0]=-1;
        while(!q.empty()){
            auto [x,y]=q.front(); q.pop();
            for(int i=0; i<4; ++i){
                int nx=x+dx[i],ny=y+dy[i];
                if(valid(nx,ny)&&!vis[nx][ny]){
                    q.push({nx,ny}),dis[_][nx][ny]=dis[_][x][y]+1,par[_][nx][ny]=i,vis[nx][ny]=1;
                }
            }
        }
    }
    for(int i=0; i<n; ++i) for(int j=0; j<m; ++j) if(a[i][j]!='#'&&dis[0][i][j]<=l&&dis[1][i][j]<=k-1-r&&(dis[0][i][j]+l)%2==0){
        if((valid(i,j-1)&&valid(i,j+1))||(valid(i-1,j)&&valid(i+1,j))){
            string res1,res2;
            int x=i,y=j;
            //cout << i << ' ' << j << endl;
            while(~par[0][x][y]){
                int tmp=par[0][x][y];
                res1+=mv[tmp];
                //cout << "tmp " << tmp << ' ' << x << ' ' << y << endl;
                x-=dx[tmp],y-=dy[tmp];
                //cout << x << ' ' << y << endl;
            }
            x=i,y=j;
            while(~par[1][x][y]){
                int tmp=par[1][x][y];
                res2+=mv[tmp^1];
                x-=dx[tmp],y-=dy[tmp];
            }
            reverse(all(res1));
            //cout << res1 << ' ' << res2 << endl;
            if(valid(i,j-1)&&valid(i,j+1)){
                while(sz(res1)+sz(res2)<k) res1+="LR";
            }
            else{
                while(sz(res1)+sz(res2)<k) res1+="UD";
            }
            res1+=res2;
            assert(sz(res1)==k);
            cout << "Yes\n" << res1 << "\n";
            return 0;
        }
    }
    cout << "No\n";
}