#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T, T Div = 2> constexpr T INFTY = std::numeric_limits<T>::max() / Div;

template <class T> bool setmin(T& lhs, const T& rhs) {
    if (lhs > rhs) {
        lhs = rhs;
        return true;
    }
    return false;
}

template <class T> using Vec = std::vector<T>;

template <class T> using Heap = std::priority_queue<T, Vec<T>, std::greater<T>>;

void main_() {
    usize H, W;
    std::cin >> H >> W;
    u64 U, D, R, L, K, P;
    std::cin >> U >> D >> R >> L >> K >> P;
    usize si, sj, gi, gj;
    std::cin >> si >> sj >> gi >> gj;
    Vec<Vec<char>> grid(H + 2, Vec<char>(W + 2, '#'));
    for (const auto i : rep(1, H + 1)) {
        for (const auto j : rep(1, W + 1)) {
            std::cin >> grid[i][j];
        }
    }
    Vec<Vec<u64>> dist(H + 2, Vec<u64>(W + 2, INFTY<u64>));
    Heap<std::tuple<u64, usize, usize>> heap;
    const auto push = [&](const usize i, const usize j, const u64 c) {
        if (grid[i][j] == '#') {
            return;
        }
        if (setmin(dist[i][j], c + P * (grid[i][j] == '@'))) {
            heap.emplace(dist[i][j], i, j);
        }
    };
    push(si, sj, 0);
    while (!heap.empty()) {
        const auto [d, i, j] = heap.top();
        heap.pop();
        if (d > dist[i][j]) {
            continue;
        }
        push(i - 1, j, d + U);
        push(i + 1, j, d + D);
        push(i, j + 1, d + R);
        push(i, j - 1, d + L);
    }
    std::cout << (dist[gi][gj] <= K ? "Yes" : "No") << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}