import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.BitSet; import java.util.HashMap; import java.util.PriorityQueue; import java.util.Queue; public class Main { public static void main(String[] args) throws NumberFormatException, IOException {Solve solve = new Solve();solve.solve();} } class Solve{ int h, w; void solve() throws NumberFormatException, IOException{ final ContestScanner in = new ContestScanner(); Writer out = new Writer(); h = in.nextInt(); w = in.nextInt(); int a = in.nextInt(); int sy = in.nextInt(); int sx = in.nextInt(); int b = in.nextInt(); int gy = in.nextInt(); int gx = in.nextInt(); char[][] map = new char[h][]; for(int i=0; i qu = new PriorityQueue<>(); final int[] dx = {1, 0, -1, 0}; final int[] dy = {0, 1, 0, -1}; qu.add(new Pos(sx, sy, a)); int max = 0; out:while(!qu.isEmpty()){ Pos p = qu.poll(); if(p.x==gx && p.y==gy){ max = Math.max(max, p.s); } for(int i=0; i<4; i++){ final int ny = dy[i]+p.y; final int nx = dx[i]+p.x; if(out(ny, nx)) continue; if(map[ny][nx]=='.'&&p.s==1) continue; int ns = p.s+(map[ny][nx]=='.'?-1:1); if(used.get(ny<<6|nx) || ns==0) continue; used.set(ny<<6|nx); if(map[p.y][p.x]=='*'&&map[ny][nx]=='*'){ max = ns+1200-dist(gx, gy, ny, nx); break out; } qu.add(new Pos(nx, ny, ns)); } } if(b<=max && max%2==b%2){ System.out.println("Yes"); return; } System.out.println("No"); } int dist(int x1, int y1, int x2, int y2){ return Math.abs(x1-x2) + Math.abs(y1-y2); } boolean out(int y, int x){ return y<0||y>=h||x<0||x>=w; } } class Pos implements Comparable{ int id, x, y, s; Pos(int x, int y, int s){ this.x = x; this.y = y; this.s = s; id = y<<6|x; } @Override public int compareTo(Pos o) { return o.s-s; } @Override public String toString() { return "("+x+","+y+","+s+")"; } } class MultiSet extends HashMap{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){ final int num = get(key); if(num==1) remove(key); else put(key, num-1); } } class Timer{ long time; public void set(){time = System.currentTimeMillis();} public long stop(){return System.currentTimeMillis()-time;} } class Writer extends PrintWriter{ public Writer(String filename) throws IOException {super(new BufferedWriter(new FileWriter(filename)));} public Writer() throws IOException{super(System.out);} } class ContestScanner { private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException {reader = new BufferedReader(new InputStreamReader(System.in));} public ContestScanner(String filename) throws FileNotFoundException {reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));} public String nextToken() throws IOException { if (line == null || line.length <= idx) { line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public String readLine() throws IOException{return reader.readLine();} public long nextLong() throws IOException, NumberFormatException {return Long.parseLong(nextToken());} public int nextInt() throws NumberFormatException, IOException {return (int) nextLong();} public double nextDouble() throws NumberFormatException, IOException {return Double.parseDouble(nextToken());} }