#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());


void _solve(){
    ll H,W;
    cin>>H>>W;
    ll a,b;
    cin>>a>>b;
    ll r1,c1,r2,c2;
    cin>>r1>>c1>>r2>>c2;
    ll P,Q;
    cin>>P>>Q;
    ll ans=0;
    auto f=[&]{
        ll sum=0;
        ll x=a;
        ll y=b;
        if(r1<=a&&a<=r2){
            //
        }else{
            ans+=min(abs(r1-a),abs(r2-a));
            if(a<r1)x=r1;
            else x=r2;
        }
        if(c1<=b&&b<=c2){
            //
        }else{
            ans+=min(abs(c1-b),abs(c2-b));
            if(b<c1)y=c1;
            else y=c2;
        }
        return (pll){x,y};
    };
    pll res=f();
    cout<<ans+abs(res.fi-P)+abs(res.se-Q)+abs(a-P)+abs(b-Q)<<"\n";
}


int main(){
    cin.tie(nullptr);
 	ios_base::sync_with_stdio(false);

    
    ll _;
    bool multitest=0;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}