#include<iostream>
#include<queue>

using namespace std;
typedef pair<int, int> pii;
int h, w, sx, sy, gx ,gy;
int fld[50][50];
int reached[50][50];
pii dd[]={{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

int abs(int a, int b){
   return max(a-b, b-a);
}

void dfs(int pi, int pj, int i, int j){

   if(!(0<=i&&i<h&&0<=j&&j<w)) return;
   if(reached[i][j]) return;
   int dif=abs(fld[pi][pj], fld[i][j]);
   if(dif>=2) return;
   int mv=abs(pi, i)+abs(pj, j);
   if(mv==2){
      if(dif==0){
         int mh=fld[(pi+i)/2][(pj+j)/2];
         if(mh>=fld[pi][pj]) return;
      }
   }

   reached[i][j]=1;

   for(pii d: dd){
      int ni, nj;
      ni=i+d.first;
      nj=j+d.second;
      dfs(i, j, ni, nj);
      dfs(i, j, ni+d.first, nj+d.second);
   }
}

int main(){

   cin>> h>> w>> sx>> sy>> gx>> gy;
   sx--; sy--; gx--; gy--;
   string b[h];
   for(int i=0; i<h; i++){
      cin>> b[i];
   }
   for(int i=0; i<h; i++){
      for(int j=0; j<w; j++){
         fld[i][j]=b[i][j]-'0';
      }
   }

   dfs(sx, sy, sx, sy);

   cout<< (reached[gx][gy]?"YES":"NO") << endl;

   return 0;
}