#include <bits/stdc++.h>
using namespace std;
vector<int> dx = {1, 0, -1, 0};
vector<int> dy = {0, 1, 0, -1};
int main(){
  int H, W, K, L, R;
  cin >> H >> W >> K >> L >> R;
  L--;
  vector<string> S(H);
  for (int i = 0; i < H; i++){
    cin >> S[i];
  }
  if ((H + W) % 2 != K % 2){
    cout << "No" << endl;
  } else if ((R - L) % 2 == 1){
    cout << "No" << endl;
  } else {
    auto check = [&](int x, int y){
      if (0 <= x && x < H && 0 <= y && y < W){
        if (S[x][y] == '.'){
          return true;
        } else {
          return false;
        }
      } else {
        return false;
      }
    };
    auto bfs = [&](int sx, int sy){
      vector<vector<int>> d(H, vector<int>(W, -1));
      d[sx][sy] = 0;
      queue<pair<int, int>> Q;
      Q.push(make_pair(sx, sy));
      while (!Q.empty()){
        int x = Q.front().first;
        int y = Q.front().second;
        Q.pop();
        for (int i = 0; i < 4; i++){
          int x2 = x + dx[i];
          int y2 = y + dy[i];
          if (check(x2, y2)){
            if (d[x2][y2] == -1){
              d[x2][y2] = d[x][y] + 1;
              Q.push(make_pair(x2, y2));
            }
          }
        }
      }
      return d;
    };
    vector<vector<int>> d1 = bfs(0, 0);
    vector<vector<int>> d2 = bfs(H - 1, W - 1);
    int px = -1, py = -1, t = -1;
    for (int i = 0; i < H; i++){
      for (int j = 0; j < W; j++){
        for (int k = 0; k < 2; k++){
          if (d1[i][j] != -1 && d2[i][j] != -1){
            if (d1[i][j] <= L && d2[i][j] <= K - R && (L - d1[i][j]) % 2 == 0){
              if (check(i + dx[k], j + dy[k]) && check(i - dx[k], j - dy[k])){
                px = i;
                py = j;
                t = k;
              }
            }
          }
        }
      }
    }
    if (px == -1 && py == -1 && t == -1){
      cout << "No" << endl;
    } else {
      auto get_path = [&](vector<vector<int>> &d, int sx, int sy, int tx, int ty){
        vector<int> ans;
        while (tx != sx || ty != sy){
          for (int i = 0; i < 4; i++){
            if (check(tx - dx[i], ty - dy[i])){
              if (d[tx - dx[i]][ty - dy[i]] == d[tx][ty] - 1){
                tx -= dx[i];
                ty -= dy[i];
                ans.push_back(i);
                break;
              }
            }
          }
        }
        reverse(ans.begin(), ans.end());
        return ans;
      };
      vector<int> ans(K, -1);
      vector<int> p1 = get_path(d1, 0, 0, px, py);
      vector<int> p2 = get_path(d2, H - 1, W - 1, px, py);
      for (int i = 0; i < d2[px][py]; i++){
        p2[i] ^= 2;
      }
      for (int i = 0; i < d1[px][py]; i++){
        ans[i] = p1[i];
      }
      for (int i = 0; i < d2[px][py]; i++){
        ans[K - 1 - i] = p2[i];
      }
      for (int i = d1[px][py]; i < K - d2[px][py]; i++){
        ans[i] = t;
        if (i % 2 == 1){
          ans[i] ^= 2;
        }
      }
      cout << "Yes" << endl;
      for (int i = 0; i < K; i++){
        cout << "DRUL"[ans[i]];
      }
      cout << endl;
    }
  }
}