#include <bits/stdc++.h>

typedef long long int ll;

using namespace std;

int mat[111][111];
int dp[111][111];
ll n,hp,ssx,ssy,ggx,ggy;

ll que[100000];
ll qb=0,qe=0;

int main(){
  cin>>n>>hp>>ssx>>ssy>>ggx>>ggy;
  
  for(int y=1;y<=n;++y){
    for(int x=1;x<=n;++x){
      scanf("%d",&(mat[y][x]));
      ++mat[y][x];
    }}
  //fill(&dp[0][0],&dp[110][110]+1,101010);

  
  hp+=mat[ssy][ssx]-1;
  dp[ssy][ssx]=hp;

  que[qb++]=((ssx<<8)|(ssy)|(hp<<32));

  ll d,x,y,s,h;
  while(qb!=qe){
    d=que[qe++];qe=qe%100000;
    x=(d>>8)&0xff;
    y=(d)&0xff;
    s=(d>>16)&0xffff;
    h=(d>>32)&0xffff;
    
    if ((h-=mat[y][x]-1)<=0) continue;
    if (x==ggx && y==ggy){
      cout << s << endl;
      exit(0);
    }
    ++s;
    if (mat[y-1][x] && h>dp[y-1][x]){
      dp[y-1][x]=h;
      que[qb++]=((y-1)|((x)<<8)|(s<<16)|(h<<32));qb=qb%100000;
    }
    if (mat[y+1][x] && h>dp[y+1][x]){
      dp[y+1][x]=h;
      que[qb++]=((y+1)|((x)<<8)|(s<<16)|(h<<32));qb=qb%100000;
    }
    if (mat[y][x-1] && h>dp[y][x-1]){
      dp[y][x-1]=h;
      que[qb++]=((y)|((x-1)<<8)|(s<<16)|(h<<32));qb=qb%100000;
    }
    if (mat[y][x+1] && h>dp[y][x+1]){
      dp[y][x+1]=h;
      que[qb++]=((y)|((x+1)<<8)|(s<<16)|(h<<32));qb=qb%100000;
    }
  }
  
  cout<<"-1"<<endl;
  
  return 0;
}