#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long ll;

int H, W;
int A, SY, SX;
int B, GY, GX;
string M[50];

bool reach[64][64][2048];
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { -1, 0, 1, 0 };

string solve()
{
	rep(i, 0, 64) rep(j, 0, 64) rep(k, 0, 2048) reach[i][j][k] = false;
	queue<pair<int, int>> que;

	reach[SY][SX][A] = true;
	que.push(make_pair(SY * 64 + SX, A));

	while (!que.empty())
	{
		auto q = que.front(); que.pop();

		int x = q.first % 64;
		int y = q.first / 64;
		int s = q.second;

		if (x == GX && y == GY && s == B) return "YES";

		rep(i, 0, 4)
		{
			int xx = x + dx[i];
			int yy = y + dy[i];
			if (xx < 0 || W <= xx) continue;
			if (yy < 0 || H <= yy) continue;

			int ss = s;
			if (M[yy][xx] == '*')
				ss++;
			else
				ss--;
			if (ss == 0) continue;

			if (!reach[yy][xx][ss])
			{
				reach[yy][xx][ss] = true;
				que.push(make_pair(yy * 64 + xx, ss));
			}
		}
	}

	return "NO";
}

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> H >> W;
	cin >> A >> SY >> SX >> B >> GY >> GX;
	rep(i, 0, H) cin >> M[i];
	cout << solve() << endl;
}