import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) fun solve() { val (H, W) = na(2) val costs = na(4) val (K, P) = nal(2) val (xs, ys, xt, yt) = na(4, -1) val grid = Array(H){ns()} data class Edge(val v: Int, val weight: Long) data class Visit(val v: Int, val cost: Long) val INF = 1e18.toLong() // U, D, R, L val dirs = arrayOf( intArrayOf(-1, 0), intArrayOf(1, 0), intArrayOf(0, 1), intArrayOf(0, -1) ) fun g(v: Int): MutableList { val row = v/W val col = v%W val res = mutableListOf() for (i in 0 until 4) { val nrow = row + dirs[i][0] val ncol = col + dirs[i][1] if (nrow in (0 until H) && ncol in (0 until W)) { val cost = when(grid[nrow][ncol]) { '.' -> 0 '#' -> INF else -> P // '@' } + costs[i] val nv = nrow * W + ncol res += Edge(nv, cost) } } return res } fun dijk(N: Int, s: Int): LongArray { val D = LongArray(N){INF} D[s] = 0 val visited = BooleanArray(N) val que = PriorityQueue(compareBy { it.cost }) que.add(Visit(s, 0)) while(que.isNotEmpty()) { val v = que.poll()!! if (visited[v.v]) continue visited[v.v] = true val edges = g(v.v) for (i in edges.indices) { val e = edges[i] if (v.cost + e.weight < D[e.v]) { D[e.v] = v.cost + e.weight que.add(Visit(e.v, D[e.v])) } } } return D } val s = xs * W + ys val t = xt * W + yt val dist = dijk(H*W, s) debug{"${dist[t]}"} val ans = if (dist[t] <= K) "Yes" else "No" out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return IntArray(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } /** * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと */ private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())} companion object { // TestRunnerから呼びたいので単純なmainじゃだめ fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() } } } /** * judgeから呼ばれる */ fun main() = Solver.main()