#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,m,sx,sy,tx,ty;
vector<vector<int>> a;
int sgn(int x){
	if(!x)return 0;
	return x>0?1:-1;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m>>sx>>sy>>tx>>ty;
	a.resize(m/2+1);
	for(int i=1;i<=m/2;++i){
		a[i].resize(n/2+1);
		for(int j=1;j<=n/2;++j)cin>>a[i][j];
	}
	int dx=abs(tx-sx),dy=abs(ty-sy);
	int nx=sgn(tx-sx),ny=sgn(ty-sy);
	int T=dx*dy;
	int ans=0;
	int x=sx/2+1,y=sy/2+1;
	if(nx&&ny){
		for(int t=0;t<=T;++t){
			int totx=dy+t,toty=dx+t;
			if(!(totx%(2*dy))&&!(toty%(2*dx))){
				vector<int> tmp={a[y][x],a[y+ny][x+nx],a[y][x+nx],a[y+ny][x]};
				sort(tmp.begin(),tmp.end());
				int maxh=tmp[2];
				if(maxh>a[y][x])ans+=maxh-a[y][x]+abs(maxh-a[y+ny][x+nx]);
				else ans+=abs(a[y][x]-a[y+ny][x+nx]);
				x+=nx,y+=ny;
			}
			else if(!(totx%(2*dy))){
				ans+=abs(a[y][x+nx]-a[y][x]);
				x+=nx;
			}
			else if(!(toty%(2*dx))){
				ans+=abs(a[y+ny][x]-a[y][x]);
				y+=ny;
			}
		}
	}
	else if(nx){
		for(int t=1;t<=dx;t+=2){
			ans+=abs(a[y][x+nx]-a[y][x]);
			x+=nx;
		}
	}
	else if(ny){
		for(int t=1;t<=dy;t+=2){
			ans+=abs(a[y+ny][x]-a[y][x]);
			y+=ny;
		}
	}
	cout<<fixed<<setprecision(12)<<ans+sqrt(1ll*dx*dx+1ll*dy*dy)<<'\n';
}