#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 2 "main.cpp"

#line 1 "/workspaces/compro/lib/graph/edge.hpp"


template <typename T> struct edge {
  int to;
  T cost;
};

#line 6 "/workspaces/compro/lib/graph/dijkstra.hpp"

#ifndef DIJKSTRA
#define DIJKSTRA

// sからの各頂点への最短距離を返す。計算量はO(E logV)
template <class T> std::vector<T> dijkstra(const int s, const std::vector<std::vector<edge<T>>> &g) {
  std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<std::pair<T, int>>> q;

  constexpr T MAX = std::numeric_limits<T>::max();
  std::vector<T> d(g.size(), MAX);
  d[s] = 0;
  q.push(std::make_pair(d[s], s));

  while (!q.empty()) {
    const auto p = q.top();
    q.pop();

    const int v = p.second;
    if (d[v] < p.first)
      continue;

    for (const auto e : g[v]) {
      const int u = e.to;
      const T next_cost = d[v] + e.cost;
      if (d[u] <= next_cost)
        continue;
      d[u] = next_cost;
      q.push(std::make_pair(d[u], u));
    }
  }
  return d;
}

#endif
#line 4 "main.cpp"

const std::string YES = "Yes";
const std::string NO = "No";

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int H, W;
  cin >> H >> W;
  vector<vector<edge<ll>>> g(H * W);
  ll U, D, R, L, K, P;
  cin >> U >> D >> R >> L >> K >> P;

  auto idx = [&W](int i, int j) -> int { return i * W + j; };

  int xs, ys, xt, yt;
  cin >> xs >> ys >> xt >> yt;
  xs--;
  ys--;
  xt--;
  yt--;

  int s = idx(xs, ys);
  int t = idx(xt, yt);

  vector<string> C(H);
  REP(i, H) { cin >> C[i]; }

  int di[4] = {1, 0, -1, 0};
  int dj[4] = {0, 1, 0, -1};
  ll cost[4] = {D, R, U, L};

  REP(i, H) {
    REP(j, W) {
      REP(k, 4) {
        if (C[i][j] == '#')
          continue;
        int ni = i + di[k];
        int nj = j + dj[k];
        if (0 <= ni && ni < H && 0 <= nj && nj < W) {
          int curIdx = idx(i, j);
          int nextIdx = idx(ni, nj);
          if (C[ni][nj] == '.') {
            g[curIdx].push_back({nextIdx, cost[k]});
          }
          if (C[ni][nj] == '@') {
            g[curIdx].push_back({nextIdx, cost[k] + P});
          }
        }
      }
    }
  }

  auto d = dijkstra(s, g);
  cout << (d[t] <= K ? YES : NO) << endl;
}