#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1510
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
x += k;
x %= mod;
if(x < 0) x += mod;
}
void del(int &x, int k)
{
x -= k;
x %= mod;
if(x < 0) x += mod;
}
int n,m,k,ll;
int a[N][N],p[N][N];
bool vis[N][N];
pii s,t,f;
int get(int l,int r,int u,int v)
{
return p[u][v] - p[l - 1][v] - p[u][r - 1] + p[l - 1][r - 1];
}
int lrow[N][N],rrow[N][N],rcol[N][N],lcol[N][N];
bool save(int i,int j)
{
return i and j and i <= n and j <= m and !a[i][j];
}
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> m >> n >> ll >> k;
cin >> t.se >> t.fi >> s.se >> s.fi;
t.fi++,t.se++,s.fi++,s.se++;
fo(i,1,n) fo(j,1,m)
{
char t;
cin >> t;
if(t == 'X') a[i][j] = 1;
if(t == '*') f = {i,j};
p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + a[i][j];
}
fo(i,1,n)
{
fo(j,1,m)
{
lrow[i][j] = lrow[i][j - 1];
if(a[i][j]) lrow[i][j] = j;
}
rrow[i][m + 1] = m + 1;
fod(j,m,1)
{
rrow[i][j] = rrow[i][j + 1];
if(a[i][j]) rrow[i][j] = j;
}
}
fo(j,1,m)
{
fo(i,1,n)
{
lcol[i][j] = lcol[i - 1][j];
if(a[i][j]) lcol[i][j] = i;
}
rcol[n + 1][j] = n + 1;
fod(i,n,1)
{
rcol[i][j] = rcol[i + 1][j];
if(a[i][j]) rcol[i][j] = i;
}
}
queue<pii> q;
q.push({t.fi,s.se});
// cout << t.fi << ' ' << s.se;en;
// cout << rrow[2][1];en;
// cout << rrow[3][1];en;
while(ss(q))
{
auto [i,j] = q.front();
q.pop();
// cout << i << ' ' << j;en;
fo(k,0,1)
{
int i1 = i + (k == 0 ? 1 : -1);
if(save(i1,j))
{
int l = max(lrow[i][j],lrow[i1][j]);
int r = min(rrow[i][j],rrow[i1][j]);
// cout << i1 << ' ' << j << ' ' << l << ' ' << r;en;
if(r - l - 1 >= k)
{
if(!vis[i1][j])
{
vis[i1][j] = 1;
q.push({i1,j});
}
}
}
int j1 = j + (k == 0 ? 1 : -1);
if(save(i,j1))
{
int l = max(lcol[i][j],lcol[i][j1]);
int r = min(rcol[i][j],rcol[i][j1]);
if(r - l - 1 >= ll)
{
if(!vis[i][j1])
{
vis[i][j1] = 1;
q.push({i,j1});
}
}
}
}
}
if(vis[f.fi][f.se]) cout << "YES";
else cout << "NO";
}
