#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;
    const int LEFT = l;
    const int RIGHT = k - r;

    if ((k % 2 != (h + w) % 2) or (r - l) % 2) {
        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 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 d0 = f(0, 0);
    auto dn = f(h - 1, w - 1);

    int fy, fx, fd;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (d0[i][j] > LEFT) continue;
            if (dn[i][j] > RIGHT) continue;
            if (d0[i][j] % 2 != LEFT % 2) continue;

            int dir = -1;
            for (int k = 0; k < 4; ++k) {
                const int ny = i + dy[k];
                const int nx = j + dx[k];
                if (nx < 0 or ny < 0 or nx >= w or ny >= h) continue;
                if (s[ny][nx] == '#') continue;

                dir = k;
            }

            if (dir == -1) continue;

            fy = i;
            fx = j;
            fd = dir;
            goto answer;
        }
    }

    puts("No");
    return 0;

answer:
    std::string ans;

    auto df = f(fy, fx);
    {
        int y = 0, x = 0;
        while (y != fy or x != fx) {
            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 (d0[y][x] + 1 + df[ny][nx] != df[0][0]) continue;
                ans += tos[k];
                y = ny;
                x = nx;
                break;
            }
        }

        r = k - dn[fy][fx];
        while (ans.size() < r) {
            ans += tos[fd];
            ans += tos[(fd + 2) % 4];
        }

        while (y != h - 1 or x != w - 1) {
            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 (df[y][x] + 1 + dn[ny][nx] != df[h - 1][w - 1]) continue;
                ans += tos[k];
                y = ny;
                x = nx;
                break;
            }
        }

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