import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(buf);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	//入力バッファサイズのつもり。入力点数（スペース区切りでの要素数）が100万を超える場合はバッファサイズを100万にすること
	static int buf = 1024;
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int H = nextInt();
		int W = nextInt();
		int[][] d = {{-1,0,nextInt()}, {1,0,nextInt()}, {0,1,nextInt()}, {0,-1,nextInt()}};//U, D, R, L
		long K = nextLong();
		int P = nextInt();
		int sy = nextInt() - 1;
		int sx = nextInt() - 1;
		int ey = nextInt() - 1;
		int ex = nextInt() - 1;
		Node[][] list = new Node[H][W];
		for(int i = 0; i < H; i++){
			String s = next();
			for(int j = 0; j < W; j++){
				list[i][j] = new Node(s.substring(j, j + 1));
			}
		}
		PriorityQueue<Q> pq = new PriorityQueue<>();
		pq.add(new Q(sy, sx, 0l));
		while(pq.size() > 0){
			Q now = pq.poll();
			int y = now.y;
			int x = now.x;
			long cost = now.cost;
			if(list[y][x].cost <= cost){
				continue;
			}
			list[y][x].cost = cost;
			for(int i = 0; i < d.length; i++){
				int nextY = y + d[i][0];
				int nextX = x + d[i][1];
				if(nextY >= 0 && nextY < H && nextX >= 0 && nextX < W){
					if(list[nextY][nextX].s.equals("#")){
						continue;
					}
					long nextCost = cost + d[i][2];
					if(list[nextY][nextX].s.equals("@")){
						nextCost += P;
					}
					if(list[nextY][nextX].cost > nextCost){
						pq.add(new Q(nextY, nextX, nextCost));
					}
				}

			}
		}
		
		if(list[ey][ex].cost <= K){
			myout("Yes");
		}else{
			myout("No");
		}
	}
	//メソッド追加エリア　ここから

static class Q implements Comparable<Q>{
	int y;
	int x;
	long cost;
	Q(int y, int x, long cost){
		this.x = x;
		this.y = y;
		this.cost = cost;
	}
	public int compareTo(Q ato){
		return Long.compare(this.cost, ato.cost);
	}
}

static class Node{
	long cost = 1l << 62;
	String s;
	Node(String s){
		this.s = s;
	}
}

	//メソッド追加エリア　ここまで
}