#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
typedef pair<P,int> PP;

void Main() {
  int n,m;
  cin >> n >> m;
  bool d[n][m][2000];
  mem(d);
  int a,sx,sy,b,tx,ty;
  cin >> a >> sx >> sy >> b >> tx >> ty;
  string s[n];
  rep(i,n) cin >> s[i];
  d[sx][sy][a]=1;
  queue<PP> que;
  que.push(PP(P(sx,sy),a));
  while(!que.empty()) {
    PP p=que.front();que.pop();
    int nx=p.F.F,ny=p.F.S,cc=p.S;
    rep(i,4) {
      int x=nx+dx[i],y=ny+dy[i],c=cc;
      if(!check(n,m,x,y)) continue;
      if(s[x][y]=='*') c++;
      else c--;
      if(c<=0||c>=2000||d[x][y][c]) continue;
      d[x][y][c]=1;
      que.push(PP(P(x,y),c));
    }
  }
  if(d[tx][ty][b]) pr("Yes");
  else pr("No");
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}