#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)

char m[60][60];
char d[60][60];
int w,h,yu,gy,gx,b;

void g(priority_queue<int>&q,int a,int y,int x){
	if(y>=0&&y<h&&x>=0&&x<w){
		a+=m[y][x]==yu?1:-1;
		if(a>0||y==gy&&x==gx&&b==0){
			q.push(a<<16|y<<8|x);
		}
	}
}

bool f(int a,int y,int x,int b,int gy,int gx,int yu) {
	::gy=gy; ::gx=gx; ::yu=yu; ::b=b;
	priority_queue<int> q;
	g(q,a,y,x);
	rep(y,h)rep(x,w)d[y][x]=0;
	while(!q.empty()){
		int t=q.top();
		q.pop();
		a=t>>16;
		y=t>>8&255;
		x=t&255;
		if(y==gy&&x==gx&&a>=b){				
			return 1;
		}
		if(d[y][x]){
			if(d[y][x]<a){
				return 1;
			}
		}else{
			d[y][x]=a;
			g(q,a,y,x-1);
			g(q,a,y,x+1);
			g(q,a,y-1,x);
			g(q,a,y+1,x);
		}
	}
	return 0;
}

int main() {
	int a,si,sj,b,gi,gj,b1,b2;
	cin>>h>>w>>a>>si>>sj>>b>>gi>>gj;
	if(a+si+sj+b+gi+gj&1){
		b1=b2=0;
	}else{
		rep(y,h)cin>>m[y];
		a-=m[si][sj]=='*'?1:-1;
		b1=f(a,si,sj,b,gi,gj,'*');
		b2=f(b,gi,gj,a,si,sj,'.');
	}
	cout<<(b1&&b2?"Yes":"No");
}