#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5,Mod=1e9+7;

namespace GRA
{
    int a,b,x1,x2,y1,y2;
    inline void Solve()
    {
        int xk=min(x2,a)-x1,yk=min(y2,b)-y1,ans=0;
        if(xk>0 && yk>0)
        {
            int xs=(1ll*xk*(xk+1)/2)%Mod;
            if(a>x2) xs=(xs+1ll*(a-x2)*xk)%Mod;
            int ys=(1ll*yk*(yk+1)/2)%Mod;
            if(b>y2) ys=(ys+1ll*(b-y2)*yk)%Mod;
            ans=1ll*xs*ys%Mod;
        }
        int all=1ll*(x2-x1)*(y2-y1)%Mod*a%Mod*b%Mod;
        int as=(1ll*a*(a+1)/2)%Mod,bs=(1ll*b*(b+1)/2)%Mod;
        int cur=1ll*as*bs%Mod;
        ans=(1ll*all+cur-ans+Mod)%Mod; cout<<ans<<endl;
    }
    inline void Run()
    {
        while(cin>>a>>b>>x1>>x2>>y1>>y2) Solve();
    }
}

int main()
{
    // freopen("1.in","r",stdin);

    GRA::Run();
    return 0;
}