#include<iostream>
#include<queue>

using namespace std;
typedef pair<int, int> pii;

int main(){

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

   pii dd[]={{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
   int H, nh, ni, nj, nni, nnj;
   pii now;
   int dist[h][w];
   fill((int*)dist, (int*)dist+h*w, 1e8);
   queue<pii> Q;
   Q.push(pii(sx, sy));
   dist[sx][sy]=0;
   while(!Q.empty()){
      now=Q.front(); Q.pop();
      if(now.first==gx&&now.second==gy){
         cout<< "YES"<< endl;
         return 0;
      }
      for(pii d: dd){
         ni=now.first+d.first;
         nj=now.second+d.second;
         if(!(0<=ni&&ni<h&&0<=nj&&nj<w)) continue;
         H=fld[now.first][now.second];
         nh=fld[ni][nj];
         if(H<nh){
            if(H+1==nh){
               if(dist[now.first][now.second]+1>=dist[ni][nj]) continue;
               dist[ni][nj]=dist[now.first][now.second]+1;
               Q.push(pii(ni, nj));
            }
         }else if(H==nh){
            if(dist[now.first][now.second]+1>=dist[ni][nj]) continue;
            dist[ni][nj]=dist[now.first][now.second]+1;
            Q.push(pii(ni, nj));
         }else{
            if(H-1==nh){
               if(dist[now.first][now.second]+1>=dist[ni][nj]) continue;
               dist[ni][nj]=dist[now.first][now.second]+1;
               Q.push(pii(ni, nj));
            }else{
               nni=ni+d.first;
               nnj=nj+d.second;
               if(!(0<=nni&&nni<h&&0<=nnj&&nnj<w)) continue;
               if(H==fld[nni][nnj]){
                  if(dist[now.first][now.second]+2>=dist[nni][nnj]) continue;
                  dist[nni][nnj]=dist[now.first][now.second]+2;
                  Q.push(pii(nni, nnj));
               }
            }
         }
      }
   }
   cout<< "NO"<< endl;
   return 0;
}