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=0&&nx=0&&ny{} 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 que=new ArrayDeque(); 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=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