#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rrep(i,n) for(int i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(int i=(a); i<(b); i++) #define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair; template using PQ = priority_queue>; template using minPQ = priority_queue, greater>; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template void outr(const T &t, const U &...u) { cout << t; outr(u...); } const int dx[4] = {1,0,-1,0}; const int dy[4] = {0,1,0,-1}; const string dirs = "DRUL"; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int h,w,k,l,r; in(h,w,k,l,r); l--; vector s(h); in(s); if(l%2 != r%2){ out("No"); return 0; } vector> ds(h,vector (w,-1)); vector> dg(h,vector (w,-1)); vector> prev_s(h,vector (w)); vector> prev_g(h,vector (w)); ds[0][0] = 0; dg[h-1][w-1] = 0; queue

q; q.push({0,0}); while(q.size()){ auto [i,j] = q.front(); q.pop(); rep(k,4){ int ni = i+dx[k], nj = j+dy[k]; if(ni < 0 or nj < 0 or ni >= h or nj >= w) continue; if(s[ni][nj] == '#') continue; if(ds[ni][nj] != -1) continue; ds[ni][nj] = ds[i][j]+1; prev_s[ni][nj] = k; q.push({ni,nj}); } } q.push({h-1,w-1}); while(q.size()){ auto [i,j] = q.front(); q.pop(); rep(k,4){ int ni = i+dx[k], nj = j+dy[k]; if(ni < 0 or nj < 0 or ni >= h or nj >= w) continue; if(s[ni][nj] == '#') continue; if(dg[ni][nj] != -1) continue; dg[ni][nj] = dg[i][j]+1; prev_g[ni][nj] = (k+2)%4; q.push({ni,nj}); } } FOR(i,1,h-1)FOR(j,1,w-1){ if(s[i][j] == '#') continue; if(ds[i][j] == -1) continue; if(ds[i][j] > l or dg[i][j] > k-r) continue; if(ds[i][j]%2 != l%2) continue; if(dg[i][j]%2 != (k-r)%2) continue; int ok = 0; string t1,t2,t3; if(s[i-1][j] == '.' and s[i+1][j] == '.'){ ok = 1; rep(_,(r-l)/2) t2 += 'U', t2 += 'D'; int nx = i, ny = j; while(nx != 0 or ny != 0){ t1 += dirs[prev_s[nx][ny]]; nx -= dx[prev_s[nx][ny]]; ny -= dy[prev_s[nx][ny]]; } reverse(ALL(t1)); rep(_, (l-ds[i][j])/2) t1 += 'U', t1 += 'D'; rep(_, (k-r-dg[i][j])/2) t3 += 'U', t3 += 'D'; nx = i, ny = j; while(nx != h-1 or ny != w-1){ t3 += dirs[prev_g[nx][ny]]; nx += dx[prev_g[nx][ny]]; ny += dy[prev_g[nx][ny]]; } } else if(s[i][j-1] == '.' and s[i][j+1] == '.'){ ok = 1; rep(_,(r-l)/2) t2 += 'L', t2 += 'R'; int nx = i, ny = j; while(nx != 0 or ny != 0){ t1 += dirs[prev_s[nx][ny]]; nx -= dx[prev_s[nx][ny]]; ny -= dy[prev_s[nx][ny]]; } reverse(ALL(t1)); rep(_, (l-ds[i][j])/2) t1 += 'L', t1 += 'R'; rep(_, (k-r-dg[i][j])/2) t3 += 'L', t3 += 'R'; nx = i, ny = j; while(nx != h-1 or ny != w-1){ t3 += dirs[prev_g[nx][ny]]; nx += dx[prev_g[nx][ny]]; ny += dy[prev_g[nx][ny]]; } } if(ok){ out("Yes"); out(t1+t2+t3); return 0; } } out("No"); }