#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)

/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#define PII pair<int,int>
/////////
using namespace::std;

// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
struct pos{
	int h,w,yuki;
	inline bool operator==(pos A){
		if( h==A.h && w==A.w && yuki==A.yuki){
			return true;
		}
		return false;
	}
};

inline void solve(){
	int H,W;
	int A,sH,sW;
	int B,gH,gW;
	cin >> H >> W;
	cin >> A >> sH >> sW;
	cin >> B >> gH >> gW;
	vector< vector<bool> > yuki(H,vector<bool>(W,false));
	string str;
	for(int i=0;i<H;++i){
		cin >> str;
		for(int j=0;j<W;++j){
			if( str[j] == '*' ){
				yuki[i][j] = true;
			}
		}
	}

	vector< vector< vector<bool> > > node;
	const int YUKI_MAX = 1300;
	node = vector< vector< vector<bool> > >(H,
		vector< vector<bool > >(W,vector<bool>(YUKI_MAX,false))
		);
	node[sH][sW][A] = true;

	queue<pos> que;
	pos start,goal;
	start.h = sH;
	start.w = sW;
	start.yuki = A;
	goal.h = gH;
	goal.w = gW;
	goal.yuki = B;
	que.push(start);
	pos now,temp;
	int dh[] = {1,0,-1,0};
	int dw[] = {0,1,0,-1};
	while( !que.empty() ){
		now = que.front();que.pop();
		for(int i=0;i<4;++i){
			temp.h = now.h + dh[i];
			temp.w = now.w + dw[i];
			if( temp.h < 0 || H <= temp.h ||
				temp.w < 0 || W <= temp.w){
					continue;//範囲外
			}
			temp.yuki = now.yuki;
			if( yuki[temp.h][temp.w] == true ){
				temp.yuki++;
			}else{
				temp.yuki--;
			}
			if( temp.yuki <= 0 || YUKI_MAX <= temp.yuki){
				continue;//雪不足||雪多すぎ
			}
			if( node[temp.h][temp.w][temp.yuki] == false ){
				if( temp == goal ){//ゴール
					cout << "Yes" << endl;return;
				}
				node[temp.h][temp.w][temp.yuki] = true;
				que.push( temp );
			}
		}
	}
	if( node[goal.h][goal.w][goal.yuki] == true ){
		cout << "Yes" << endl;
	}else{
		cout << "No" << endl;
	}
}

signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	//std::cout << std::fixed;//小数を10進数表示
	//cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();
}