#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int H,W,K,L,R;
	cin>>H>>W>>K>>L>>R;
	L--;
	vector<string> p(H);
	rep(i,0,H) cin>>p[i];
	if(0!=((R-L)&1)&&((H+W+1+1+K)&1)!=0){
		cout<<"No\n";
		return;
	}
	auto out=[&](int a,int b)->bool{
		return a<0||b<0||a>=H||b>=W||p[a][b]=='#';
	};
	vector<int> dx={1,0,-1,0},dy={0,1,0,-1};
	auto f=[&](int a,int b)->vector<vector<int>>{
		vector<vector<int>> seen(H,vector<int>(W,INF));
		vector<pair<int,int>> order={{a,b}};
		seen[a][b]=0;
		rep(i,0,order.size()){
			auto [x,y]=order[i];
			rep(k,0,4){
				int s=x+dx[k],t=y+dy[k];
				if(out(s,t)) continue;
				if(seen[s][t]==INF){
					seen[s][t]=seen[x][y]+1;
					order.push_back({s,t});
				}
			}
		}
		return seen;
	};
	auto X=f(0,0),Y=f(H-1,W-1);
	vector<vector<int>> safe(H,vector<int>(W,-1));
	rep(i,0,H) rep(j,0,W){
		rep(k,0,2){
			if(!(out(i,j)|out(i+dx[k],j+dy[k])|out(i+dx[k+2],j+dy[k+2]))) safe[i][j]=k;
		}
	}
	string ans="";
	string D="DRUL";
	rep(i,0,H) rep(j,0,W){
		//cout<<i<<" "<<j<<" : "<<X[i][j]<<" "<<Y[i][j]<<" "<<safe[i][j]<<endl;
		if((i+j+L)&1) continue;
		if(safe[i][j]==-1) continue;
		if(X[i][j]>L||Y[i][j]>K-R) continue;
		int x=i,y=j;
		while(x+y){
			rep(k,0,4){
				int s=dx[k]+x,t=y+dy[k];
				if(out(s,t)) continue;
				if(X[s][t]+1==X[x][y]){
					ans+=D[k^2];
					x=s,y=t;
					break;
				}
			}
		}
		reverse(all(ans));
		while((int)ans.size()!=K-Y[i][j]){
			if((int)ans.size()&1) ans+=D[safe[i][j]];
			else ans+=D[safe[i][j]+2]; 
		}
		x=i,y=j;
		while(Y[x][y]){
			rep(k,0,4){
				int s=dx[k]+x,t=y+dy[k];
				if(out(s,t)) continue;
				if(Y[s][t]+1==Y[x][y]){
					ans+=D[k^2];
					x=s,y=t;
					break;
				}
			}
		}
		cout<<"Yes\n";
		cout<<ans<<"\n";
		return;
	}
	cout<<"No\n";
}