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

ll gcd(ll a , ll b)
{
   if(b==0) return a;
   a%=b;
   return gcd(b,a);
}

void flipW(vector<vector<ll>> & a){
    /* cerr<<"flipW\n"; */
    for(ll y=0;y<a.size();++y){
        for(ll x=0;x<a[y].size()/2;++x){
            swap(a[y][x], a[y][a[y].size()-1-x]);
        }
    }
}

void flipH(vector<vector<ll>> & a){
    /* cerr<<"flipH\n"; */
    for(ll y=0;y<a.size()/2;++y){
        for(ll x=0;x<a[y].size();++x){
            swap(a[y][x], a[a.size()-1-y][x]);
        }
    }
}

int main(){
    ll W,H,Sx,Sy,Ex,Ey;
    cin>>W>>H>>Sx>>Sy>>Ex>>Ey;
    vector<vector<ll>> a(H/2,vector<ll>(W/2));
    for(auto &v:a)for(ll &i:v)cin>>i;

    /* cerr<<"inWH: "<<W<<' '<<H<<endl; */
    /* cerr<<"inSE: "<<Sx<<' '<<Sy<<' '<<Ex<<' '<<Ey<<endl; */
    /* for(auto &v:a){ for(ll &i:v)cerr<<i<<' '; cerr<<endl; } */
    if(Ex < Sx){ Sx=W-Sx; Ex=W-Ex; flipW(a); }
    if(Ey < Sy){ Sy=H-Sy; Ey=H-Ey; flipH(a); }
    /* cerr<<"inWH: "<<W<<' '<<H<<endl; */
    /* cerr<<"inSE: "<<Sx<<' '<<Sy<<' '<<Ex<<' '<<Ey<<endl; */
    /* for(auto &v:a){ for(ll &i:v)cerr<<i<<' '; cerr<<endl; } */

    ld res=0;
    if(Ey == Sy){
        res+=(Ex-Sx);
        for(ll i=Sx;i<Ex;i+=2){
            res+=abs(a[Sy/2][(i+1)/2]-a[Sy/2][i/2]);
        }
    }else if(Ex == Sx){
        res+=(Ey-Sy);
        for(ll i=Sy;i<Ey;i+=2){
            res+=abs(a[(i+1)/2][Sx/2]-a[i/2][Sx/2]);
        }
    }else{
        res=0;
        ll tw=abs(Sx-Ex);
        ll th=abs(Sy-Ey);
        ll g=gcd(tw, th);
        // ll g=__gcd(tw,th);
        vector<char> pattern;
        ll gw = tw/g;
        ll gh = th/g;
        ll cw=1;
        ll ch=1;
        while(true){
            /* cerr << cw << ' ' << ch << "  ,  " << tw << ' ' << th << endl; */
            if(cw*th < ch*tw){ // width reaches end first
                ++cw;
                pattern.push_back('w');
            }else if(cw*th > ch*tw){ // height reaches end first
                ++ch;
                pattern.push_back('h');
            }else{ // they traverse a corner
                pattern.push_back('c');
                break;
            }
        }
        /* cerr << "G: " << g << endl; */
        /* cerr << "Pattern: "; for(char c:pattern) cerr<<c<<' '; cerr<<endl; */

        vector<ll> heights;
        ll current_height = a[Sy/2][Sx/2];
        heights.push_back(current_height);
        ll sx=Sx,sy=Sy;
        /* cerr<<"xyz "<<sx<<' '<<sy<<' '<<heights.back()<<endl; */
        for(ll i=0;i<g;++i){
            for(ll j=0; j<pattern.size(); ++j){
                char c = pattern[j];
                if(c == 'w'){
                    sx+=1;
                }else if(c == 'h'){
                    sy+=1;
                }else if(c == 'c'){
                    ll ledge=max(a[sy/2][sx/2],min(a[sy/2][(sx+1)/2], a[(sy+1)/2][sx/2]));
                    heights.push_back(ledge);
                    sx+=1;
                    sy+=1;
                }
                /* cerr << "pattern: " << c << ", rep: " << i << endl; */
                /* if(i==g-1 && j==pattern.size()-1){ */
                /*     cerr <<"interrupterd \n"; */
                /*     break; */
                /* } */
                /* cerr << sx << ' ' << sy << ' ' << a.size() << ' ' << a[0].size() << endl; */
                current_height = a[sy/2][sx/2];
                heights.push_back(current_height);
                /* cerr<<"xyz "<<sx<<' '<<sy<<' '<<heights.back()<<endl; */
            }
        }

        // add the straight-line distance from above
        res += sqrt(tw*tw + th*th);
        // add the up and down climbing
        for(ll i=0;i<((int)heights.size())-1;++i){
            res += abs(heights[i+1]-heights[i]);
        }
    }

    cout << fixed << setprecision(12);
    cout << res << endl;

    return 0;
}