#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout<<(p)<<endl;
#define pi 3.1415926535
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

unsigned long long sttoi(std::string str) {
	unsigned long long ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

ll gcd(ll a, ll b){
	if (b > a)swap(a, b);
	if (b == 0) return a;
	return gcd(b, a%b);
}
int visited[50][50][5000];
void solve() {
	int h, w, a, sx, sy, b, gx, gy;
	cin >> h >> w >> a >> sy >> sx >> b >> gy >> gx;
	int field[50][50];
	for (int i = 0; i < h; i++){
		string s;
		cin >> s;
		for (int j = 0; j < w; j++){
			field[i][j] = s[j] == '.' ? 0 : 1;
		}
	}
	queue<pair<pair<int, int>, int> > que;
	que.push(make_pair(make_pair(sx, sy), a));
	visited[sy][sx][a] = 1;
	while (!que.empty()){
		int x = que.front().first.first;
		int y = que.front().first.second;
		int s = que.front().second;
		visited[y][x][s] = 1;
		que.pop();
		if (s > 0){
			for (int i = 0; i < 4; i++){
				int nx = x + dx[i];
				int ny = y + dy[i];
				if (nx >= 0 && nx < w && ny >= 0 && ny < h && s + 1 < 5000){
					int ns;
					if (field[ny][nx] == 1) ns = s + 1;
					else ns = s - 1;
					if (visited[ny][nx][ns] != 1){
						visited[ny][nx][ns] = 1;
						que.push(make_pair(make_pair(nx, ny), ns));
					}
				}
			}
		}
	}
	P(visited[gy][gx][b] ? "Yes" : "No");
}

int main() {
	solve();
	return 0;
}