import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.PriorityQueue;
import java.math.BigDecimal;
import java.math.BigInteger;
    
public class Main{

static final InputStream in=System.in;
static final PrintWriter out=new PrintWriter(System.out);
static final int INF=Integer.MAX_VALUE/2;
static final long LINF=Long.MAX_VALUE/2;
static int n,v,sx,sy,gx,gy,ans;
static AdjacentList[] al;
static int[][] map;
static int[] dx={0,-1,0,1};
static int[] dy={-1,0,1,0};

public static void main(String[] args) throws IOException{
InputReader ir=new InputReader(in);
n=ir.nextInt();
v=ir.nextInt();
sx=ir.nextInt();
sy=ir.nextInt();
gx=ir.nextInt();
gy=ir.nextInt();
ans=INF;
al=new AdjacentList[n*n];
map=new int[n][n];
for(int i=0;i<n;i++) for(int j=0;j<n;j++) map[i][j]=ir.nextInt();
for(int i=0;i<n*n;i++) al[i]=new AdjacentList();
for(int i=0;i<n*n;i++){
int x=i/n;
int y=i%n;
for(int j=0;j<4;j++){
int nx=x+dx[j];
int ny=y+dy[j];
if(nx>=0&&nx<n&&ny>=0&&ny<n) al[i].add(new Edge(nx*n+ny,map[nx][ny]));
}
}
bfs();
out.println(ans==INF?-1:ans);
out.flush();
}

static class Edge{
int to;
int cost;
public Edge(int to,int cost){
this.to=to; this.cost=cost;
}
}

static class AdjacentList extends ArrayList<Edge>{}

static class Info{
int v;
int damage;
int times;
int prev;
public Info(int v,int damage,int times,int prev){
this.v=v; this.damage=damage; this.times=times; this.prev=prev;
}
}

public static void bfs(){
Deque<Info> que=new ArrayDeque<Info>();
que.offerLast(new Info(0,0,0,-1));
while(!que.isEmpty()){
Info I=que.pollFirst();
int v=I.v;
int d=I.damage;
int t=I.times;
int p=I.prev;
if(d>=v) continue;
else if(v==n*n-1) ans=Math.min(ans,t);
else{
AdjacentList list=al[v];
for(int i=0;i<list.size();i++){
Edge e=list.get(i);
if(e.to!=p) que.offerLast(new Info(e.to,d+e.cost,t+1,v));
}
}
}
}

static class InputReader {
private InputStream in;
private byte[] buffer=new byte[1024];
private int curbuf;
private int lenbuf;

public InputReader(InputStream in) {this.in=in;}
  
public int readByte() {
if(lenbuf==-1) throw new InputMismatchException();
if(curbuf>=lenbuf){
curbuf= 0;
try{
lenbuf=in.read(buffer);
}
catch (IOException e) {
throw new InputMismatchException();
}
if(lenbuf<=0)
return -1;
}
return buffer[curbuf++];
}

public boolean isSpaceChar(int c){return !(c>=33&&c<=126);}

private int skip() {int b; while((b = readByte())!=-1&&isSpaceChar(b)); return b;}

public String next() {
int b=skip();
StringBuilder sb=new StringBuilder();
while(!isSpaceChar(b)){
sb.appendCodePoint(b);
b=readByte();
}
return sb.toString();
}
 
public int nextInt() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
int res=0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public long nextLong() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
long res = 0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public double nextDouble(){return Double.parseDouble(next());}

public BigInteger nextBigInteger(){return new BigInteger(next());}

public int[] nextIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
}
}