#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod=1e9+7;

struct UNKO{
    int r,c,cnt;
    UNKO(int _r,int _c,int _cnt){r=_r,c=_c,cnt=_cnt;}
    UNKO(){r=c=cnt=0;}
};
int akichi[52][52];
bool dp[52][52][3501];
const int INF=-(1e5);
const int dir[5]={-1,0,1,0,-1};
inline bool inner(int l,int n,int r){
    return(l<=n&&n<=r);
}
int main() {
    for(int i = 0; i < 52; i++)
        for(int j = 0; j < 52; j++){
            akichi[i][j]=INF;
            for(int k = 0; k < 3501; k++)
                dp[i][j][k]=false;
            }
    int R,C;cin>>R>>C;
    int A,sr,sc;cin>>A>>sr>>sc;
    int B,gr,gc;cin>>B>>gr>>gc;
    for(int i = 0; i < R; i++)
        for(int j = 0; j < C; j++){
            char c;cin>>c;
            if(c=='*')akichi[i+1][j+1]=1;
            else akichi[i+1][j+1]=-1;

        }
    queue<UNKO> que;
    que.push(UNKO(sr+1,sc+1,A));
    dp[sr+1][sc+1][A]=true;
    while(que.empty()==false){
        auto v=que.front();que.pop();
        for(int i=0;i<4;i++){
            int nr=v.r+dir[i],nc=v.c+dir[i+1],ncnt=v.cnt+akichi[nr][nc];
            if(inner(1,ncnt,3500)&&dp[nr][nc][ncnt]==false){
                dp[nr][nc][ncnt]=true;
                que.push(UNKO(nr,nc,ncnt));
            }
        }
    }
    if(dp[gr+1][gc+1][B])cout<<"Yes"<<endl;
    else cout<<"No"<<endl;

}