#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cerr;
using std::cin;
using std::cout;
using std::endl;

#if defined(DONLINE_JUDGE)
#define NDEBUG
#elif defined(ONLINE_JUDGE)
#define NDEBUG
#endif

template <typename T>
std::vector<T> make_v(size_t a) {
    return std::vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

int main() {
    int h, w, k, l, r;
    scanf("%d%d%d%d%d", &h, &w, &k, &l, &r);
    std::vector<std::string> s(h);
    for (auto& v : s) std::cin >> v;

    --l;

    if ((r - l) % 2) {
        puts("No");
        return 0;
    }
    if (l == 0 or r == k) {
        puts("No");
        return 0;
    }

    std::vector<int> dy{0, 1, 0, -1};
    std::vector<int> dx{1, 0, -1, 0};
    std::string tos = "RDLU";
    auto g = [](char c) {
        if (c == 'R') return 0;
        if (c == 'D') return 1;
        if (c == 'L') return 2;
        if (c == 'U') return 3;
        return -1;
    };

    auto f = [&](int sy, int sx) {
        std::vector d(h, std::vector<int>(w, 1 << 30));
        d[sy][sx] = 0;

        std::queue<std::pair<int, int>> qu({{sy, sx}});
        while (!qu.empty()) {
            auto [y, x] = qu.front();
            qu.pop();

            for (int k = 0; k < 4; ++k) {
                const int ny = y + dy[k];
                const int nx = x + dx[k];
                if (nx < 0 or ny < 0 or nx >= w or ny >= h) continue;
                if (s[ny][nx] == '#') continue;
                if (d[ny][nx] != 1 << 30) continue;

                qu.push({ny, nx});
                d[ny][nx] = d[y][x] + 1;
            }
        }
        return d;
    };

    auto sakina = [&](int y, int x, int ty, int tx) {
        auto ds = f(y, x);
        auto dt = f(ty, tx);

        std::string ans = "";
        while (y != ty or x != tx) {
            for (int k = 0; k < 4; ++k) {
                const int ny = y + dy[k];
                const int nx = x + dx[k];
                if (ny < 0 or nx < 0 or ny >= h or nx >= w) continue;
                if (s[ny][nx] == '#') continue;

                if (ds[y][x] + 1 + dt[ny][nx] != ds[ty][tx]) continue;

                ans += tos[k];
                y = ny;
                x = nx;
                break;
            }
        }
        return ans;
    };

    auto d0 = f(0, 0);
    auto dn = f(h - 1, w - 1);

    if (k % 2 != dn[0][0] % 2) {
        puts("No");
        return 0;
    }
    if (k - dn[0][0] < r - l) {
        puts("No");
        return 0;
    }

    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (s[i][j] == '#') continue;
            if (d0[i][j] > l) continue;
            if (d0[i][j] % 2 != l % 2) continue;
            if (dn[i][j] > k - r) continue;

            int dir = -1;
            if (i + 1 < h and i - 1 >= 0 and s[i + 1][j] == '.' and
                s[i - 1][j] == '.') {
                dir = 1;
            }
            if (j + 1 < w and j - 1 >= 0 and s[i][j + 1] == '.' and
                s[i][j - 1] == '.') {
                dir = 0;
            }

            if (dir == -1) continue;

            std::string ans = sakina(0, 0, i, j);
            while (ans.size() < r) {
                ans += tos[dir];
                ans += tos[(dir + 2) % 4];
            }
            ans += sakina(i, j, h - 1, w - 1);

            puts("Yes");
            std::cout << ans << std::endl;
            return 0;
        }
    }

    puts("No");
    return 0;
}