#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int H, W;
int A, Sx, Sy;
int B, Gx, Gy;
vs G;

void init(){
  cin >> H >> W;
  cin >> A >> Sx >> Sy;
  cin >> B >> Gx >> Gy;
  G = vs( H );
  for( int i = 0; i < H; ++i )
    cin >> G[ i ];
}

const int MAXHP = 1000 + 2500;

bool dp[ 50 + 1 ][ 50 + 1 ][ MAXHP + 1 ];

void preprocess(){
  dp[ Sx ][ Sy ][ A ] = 1;
  queue< tuple< int, int, int > > que;
  que.emplace( Sx, Sy, A );
  while( not que.empty() ){
    int x, y, v; tie( x, y, v ) = que.front(); que.pop();
    const int dx[] = { 0, 1, 0, -1 };
    const int dy[] = { 1, 0, -1, 0 };
    for( int di = 0; di < 4; ++di ){
      int nx = x + dx[ di ];
      int ny = y + dy[ di ];
      if( not ( 0 <= nx and nx < H and 0 <= ny and ny < W ) ) continue;
      int nv = v + ( G[ nx ][ ny ] == '*' ? 1 : -1 );
      if( not ( 0 < nv and nv <= MAXHP ) ) continue;
      if( dp[ nx ][ ny ][ nv ] ) continue;
      dp[ nx ][ ny ][ nv ] = 1;
      que.emplace( nx, ny, nv );
    }
  }
}

void solve(){
  const string msg[] = { "No", "Yes" };
  cout << msg[ dp[ Gx ][ Gy ][ B ] ] << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}