#include <string> #include <vector> #include<iostream> #include<cstdio> #include<cstdlib> #include<stack> #include<queue> #include<cmath> #include<algorithm> #include<functional> #include<list> #include<deque> #include<bitset> #include<set> #include<map> #include<unordered_map> #include<cstring> #include<sstream> #include<complex> #include<iomanip> #include<numeric> #define X first #define Y second #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)) #define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() #define eb emplace_back #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<class T> using vv=vector<vector<T>>; template<class T> ostream& operator<<(ostream &os, const vector<T> &t) { os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;} template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";} const ll MOD=1e9+7; int mx[99][99][3123],dx[]={1,0,-1,0},dy[]={0,1,0,-1}; #include<cassert> typedef pair<pii,int> piii; int main(){ ios_base::sync_with_stdio(false); cout<<fixed<<setprecision(0); int n,m,a,sx,sy,b,gx,gy;; cin>>n>>m>>a>>sy>>sx>>b>>gy>>gx; vector<string> mp(n); rep(i,n) cin>>mp[i]; if((sy+sx-gy-gx+a-b)%2){ //assert(0); cout<<"No"<<endl; return 0; } mx[sy][sx][a]=1; queue<piii> que; que.emplace(pii(sx,sy),a); while(que.size()){ piii p=que.front(); que.pop(); int t=p.Y; //if(p.X==gx && p.Y==gy && t>=b) break; rep(d,4){ int x=p.X.X+dx[d],y=p.X.Y+dy[d]; if(x<0 || m<=x || y<0 || n<=y) continue; int tt=t-1; if(mp[y][x]=='*') tt+=2; if(tt<=0 || 3000<tt) continue; if(!mx[y][x][tt]){ que.emplace(pii(x,y),tt); mx[y][x][tt]=1; } } } cout<<(mx[gy][gx][b]?"Yes":"No")<<endl; return 0; }