// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::collections::*;

fn run() {
    input! {
        h: usize,
        w: usize,
        cost: [i64; 6],
        src: (usize, usize),
        dst: (usize, usize),
        s: [bytes; h],
    }
    let dir = [(!0, 0, cost[0]), (1, 0, cost[1]), (0, 1, cost[2]), (0, !0, cost[3])];
    let p = cost[5];
    let k = cost[4];
    let h = h + 2;
    let w = w + 2;
    let mut s = s;
    s.iter_mut().for_each(|c| {
        c.insert(0, b'#');
        c.push(b'#');
    });
    s.insert(0, vec![b'#'; w]);
    s.push(vec![b'#'; w]);
    let mut dp = vec![vec![k + 1; w]; h];
    let mut h = BinaryHeap::new();
    dp[src.0][src.1] = 0;
    h.push((0, src.0, src.1));
    while let Some((d, x, y)) = h.pop() {
        let d = -d;
        if d > dp[x][y] {
            continue;
        }
        for &(dx, dy, c) in dir.iter() {
            let x = x + dx;
            let y = y + dy;
            let d = if s[x][y] == b'.' {
                d + c
            } else if s[x][y] == b'@' {
                d + c + p
            } else {
                k + 1
            };
            if dp[x][y].chmin(d) {
                h.push((-d, x, y));
            }
        }
    }
    let v = dp[dst.0][dst.1];
    if v <= k {
        println!("Yes");
    } else {
        println!("No");
    }
}

fn main() {
    run();
}