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

int n,m,N;
int sx,sy,tx,ty;
vector< vector<int> >h;

int sqr(int x){ return x*x; }

double ans;

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>m>>n>>sy>>sx>>ty>>tx;
	
	ans= hypot( sx-tx,sy-ty );
	
	for(int i=1;i<=n/2;i++)
	{
		vector<int>_;
		for(int j=1;j<=m/2;j++) 
		{
			int hi; cin>>hi;
			_.push_back(hi);
			_.push_back(hi);
		}
		h.push_back(_);
		h.push_back(_);
	}
	
	if(sx>tx)
	{
		for(int i=0;i<n;i++) if(i<n-i-1)
		{
			swap(h[i],h[n-i-1]);
		}
		swap(sx,tx);
	}
	if(sy>ty)
	{
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++) if(j<m-j-1)
			{
				swap(h[i][j],h[i][m-j-1]);
			}
		}
		swap(sy,ty);
	}
	
	int dx=tx-sx, dy=ty-sy;
	{
		int d= __gcd(abs(dx),abs(dy));
		dx/=d, dy/=d;
	}
	
	if(sx==tx)
	{
		if(sy<ty)
		{
			for(int j=sy;j<ty;j++) ans+=abs(h[sx][j]-h[sx][j+1]);
		}
/*		else
		{
			for(int j=sy;j>ty;j--) ans+=abs(h[sx][j]-h[sx][j-1]);
		}*/
	}
	else
	{
		for(int i=sx+1,j=sy;i<=tx;i++)
		{
			double d, u;
			if(sy<=ty)
			{
				d= (double)sy+(i-1-sx)*dy/dx;
				u= (double)sy+(i-sx)*dy/dx;
				
				int pj=j;
				while( (j+1)<=u )
				{
					if(j+1==u && (i-sx)*dy%dx==0)
					{
						if( min(h[i-1][j+1],h[i][j]) > max(h[i-1][j],h[i][j+1]) )
						{
							int temp= min(h[i-1][j+1],h[i][j]);
							ans+= abs( temp-h[i-1][j] ) + abs( temp-h[i][j+1] );
							j++;
						}
						else
						{
							ans+= abs(h[i-1][j]-h[i][j+1]);
							j++;
						}
					}
					else
					{
						ans+= abs(h[i-1][j]-h[i-1][j+1]);
						j++;
					}
				}
				if( (i-sx)*abs(dy)%dx!=0 || j==pj )
				{
					ans+= abs( h[i-1][j]-h[i][j] );
				}
			}
		/*	else
			{
				u= (double)sy+(i-1-sx)*dy/dx;
				d= (double)sy+(i-sx)*dy/dx;
				
				while( (j-1)>=d )
				{
					if(j-1==d && (i-sx)*abs(dy)%dx==0)
					{
						if( min(h[i-1][j-1],h[i][j]) > max(h[i-1][j],h[i][j-1]) )
						{
							int temp= min(h[i-1][j-1],h[i][j]);
							ans+= abs( temp-h[i-1][j] ) + abs( temp-h[i][j-1] );
							j--;
						}
						else
						{
							ans+= abs(h[i-1][j]-h[i][j-1]);
						}
					}
					else
					{
						ans+= abs(h[i-1][j]-h[i-1][j-1]);
						j--;
					}
				}
				if( (i-sx)*abs(dy)%dx!=0 )
				{
					ans+= abs( h[i-1][j]-h[i][j] );
				}
			}*/
		}
	}
	cout<<fixed<<setprecision(12)<<ans<<endl;
	
	return 0;
}