#include <bits/stdc++.h>

using namespace std;

const int N = 1505;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};

int n, m, K, L, sx, sy;
char a[N][N];
int l[N][N], r[N][N], u[N][N], d[N][N];
int vis[N][N], ans;

inline void Init()
{
	for(int i = 1; i <= n; i ++ )
	{
		l[i][1] = 1;
		for(int j = 2; j <= m; j ++ )
			l[i][j] = a[i][j - 1] == 'X' ? j : l[i][j - 1];
	}
	for(int i = 1; i <= n; i ++ )
	{
		r[i][m] = m;
		for(int j = m - 1; j >= 1; j -- )
			r[i][j] = a[i][j + 1] == 'X' ? j : r[i][j + 1];
	}
	for(int i = 1; i <= m; i ++ )
	{
		u[1][i] = 1;
		for(int j = 2; j <= n; j ++ )
			u[j][i] = a[j - 1][i] == 'X' ? j : u[j - 1][i];
	}
	for(int i = 1; i <= m; i ++ )
	{
		d[n][i] = n;
		for(int j = n - 1; j >= 1; j -- )
			d[j][i] = a[j + 1][i] == 'X' ? j : d[j + 1][i];
	}
}
inline void DFS(int i, int j)
{
	vis[i][j] = 1;
	if(a[i][j] == '*') ans = 1;
	for(int t = 0; t < 4; t ++ )
	{
		int x = i + dx[t], y = j + dy[t];
		if(x < 1 || x > n || y < 1 || y > m) continue;
		if(a[x][y] == 'X' || vis[x][y]) continue;
		if(min(r[x][y], r[i][j]) - max(l[x][y], l[i][j]) + 1 < K) continue;
		// printf("!%d %d %d %d %d %d\n", i, j, x, y, min(d[x][y], d[i][j]), max(u[x][y], u[i][j]));
		if(min(d[x][y], d[i][j]) - max(u[x][y], u[i][j]) + 1 < L) continue;
		DFS(x, y);
	}
}

int main()
{
	scanf("%d%d%d%d", &m, &n, &K, &L);
	scanf("%*d%d%d%*d", &sx, &sy), sx ++ , sy ++ ;
	for(int i = 1; i <= n; i ++ ) scanf("%s", a[i] + 1);
	Init();
	DFS(sx, sy);
	puts(ans ? "YES" : "NO");
	// for(int i = 1; i <= n; i ++ )
	// {
	// 	for(int j = 1; j <= m; j ++ ) printf("%d", vis[i][j]);
	// 	puts("");
	// }
	return 0;
}