#include using namespace std; using int64 = long long; const int mod = 1e9 + 7; // const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } const int vy[] = {-1, 1, 0, 0}; const int vx[] = {0, 0, 1, -1}; int main() { int H, W; cin >> H >> W; vector< int > C(4); cin >> C; int64 K; cin >> K; int P; cin >> P; int a, b, c, d; cin >> a >> b >> c >> d; --a, --b, --c, --d; auto A = make_v< string >(H); cin >> A; using tap = tuple< int64, int, int >; priority_queue< tap, vector< tap >, greater<> > que; auto dp = make_v< int64 >(H, W); fill_v(dp, inf); dp[a][b] = 0; que.emplace(0, a, b); while(not que.empty()) { auto[cost, y, x] = que.top(); que.pop(); for(int k = 0; k < 4; k++) { int ny = y + vy[k]; int nx = x + vx[k]; if(ny < 0 or ny >= H or nx < 0 or nx >= W) { continue; } int64 nxt = cost + C[k]; if(A[ny][nx] == '#') { continue; } if(A[ny][nx] == '@') { cost += P; } if(chmin(dp[ny][nx], nxt)) { que.emplace(nxt, ny, nx); } } } if(dp[c][d] <= K) cout << "Yes\n"; else cout << "No\n"; }