#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const int MAXN = 2e3 + 7;
char T[MAXN][MAXN];
int vis[MAXN][MAXN];
int Left[MAXN][MAXN];
int Right[MAXN][MAXN];
int up[MAXN][MAXN];
int down[MAXN][MAXN];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int n, m, k, l;
int targetX, targetY;
int startX, startY;
void preprocessing(){
for(int i = 0; i < n; i++){
int cnt = 0;
for(int j = 0; j < m; j++){
if(T[i][j] == 'X'){
cnt = 0;
}else{
cnt++;
}
Left[i][j] = cnt;
}
cnt = 0;
for(int j = m - 1; j >= 0; j--){
if(T[i][j] == 'X'){
cnt = 0;
}else{
cnt++;
}
Right[i][j] = cnt;
}
}
for(int j = 0; j < m; j++){
int cnt = 0;
for(int i = 0; i < m; i++){
if(T[i][j] == 'X'){
cnt = 0;
}else{
cnt++;
}
up[i][j] = cnt;
}
cnt = 0;
for(int i = n - 1; i >= 0; i--){
if(T[i][j] == 'X'){
cnt = 0;
}else{
cnt++;
}
down[i][j] = cnt;
}
}
}
bool canMove(int x, int y, int nx, int ny){
if(x == nx){
int cnt = min(up[nx][ny], up[x][y]) + min(down[nx][ny], down[x][y]) - 1;
return cnt >= l;
}
int cnt = min(Left[nx][ny], Left[x][y]) + min(Right[nx][ny], Right[x][y]) - 1;
return cnt >= k;
}
void dfs(int x, int y){
vis[x][y] = 1;
for(int z = 0; z < 4; z++){
int nx = x + dx[z];
int ny = y + dy[z];
if(min(nx, ny) < 0 || nx >= n || ny >= m || T[nx][ny] == 'X' || vis[nx][ny]){
continue;
}
if(canMove(x, y, nx, ny)){
dfs(nx, ny);
}
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> m >> n >> k >> l;
int a, b, c, d;
cin >> a >> b >> c >> d;
startX = b;
startY = c;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cin >> T[i][j];
if(T[i][j] == '*'){
targetX = i;
targetY = j;
}
}
}
preprocessing();
dfs(startX, startY);
cout << (vis[targetX][targetY] ? "YES\n" : "NO\n");
return 0;
}
