#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
int mi(int x,int y){
    int sum=1;
    while(y){
        if(y&1)sum=sum*x%mod;
        x=x*x%mod;
        y>>=1;
    }return sum;
}
int r(int x,int y){
    return (1+y)*y%mod*mi(4,mod-2)%mod*(x*x%mod+x)%mod;
}
signed main(){
    int n,m;
    while(cin>>n>>m){
        int x1,x2,y1,y2,ans=0,l1,r1;
        cin>>x1>>x2>>y1>>y2;l1=x2-x1;r1=y2-y1;
        if(n>x2&&m>y2)ans=(r(n,m)+r(x2,y2)+mod-r(n,y2)-r(x2,m))%mod;//cout<<ans<<endl;
        int g=min(n,x1),f=min(m,y1);
        ans=(ans+g*f%mod*l1%mod*r1%mod+r(g,f))%mod;
        if(n>x1){
            int g1=n-x1;
            ans=(ans+g1*f%mod*l1%mod*r1%mod+r(g1+x1,f)-r(g,f)+mod)%mod;
        }
        if(m>y1){
            int f1=m-y1;
            ans=(ans+g*f1%mod*l1%mod*r1%mod+r(g,f1+y1)-r(g,f)+mod)%mod;
        }
        if(n>x1&&m>y1){
            int g1=min(x2,n)-x1;
            int f1=min(y2,m)-y1;
            ans=(ans+g1*f1%mod*l1%mod*r1%mod+r(g1+x1,f1+y1)-r(g1,f1)-r(g1+x1,y1)-r(x1,f1+y1)+r(x1,y1))%mod;
            ans=(ans+mod)%mod;
        }
        if(n>x2&&m>y1){
            int g1=n-x2;
            int f1=min(y2,m)-y1;//cout<<g1<<" "<<f1<<endl;
            ans=(ans+r(g1+x2,f1+y1)-r(g1+x2,y1)-r(x2,f1+y1)+r(x2,y1))%mod;
            ans=(ans+(l1*(r1-1)%mod+l1*(r1-f1)%mod)*f1%mod*mi(2,mod-2)%mod*g1%mod)%mod;
        }//cout<<ans<<endl;
        if(n>x1&&m>y2){
            int g1=min(x2,n)-x1;
            int f1=m-y2;
            ans=(ans+r(g1+x1,f1+y2)-r(g1+x1,y2)-r(x1,f1+y2)+r(x1,y2))%mod;
            ans=(ans+(r1*(l1-1)%mod+r1*(l1-g1)%mod)*g1%mod*mi(2,mod-2)%mod*f1%mod)%mod;
            //cout<<r(g1+x1,f1+y2)-r(g1+x1,y2)-r(x1,f1+y2)+r(x1,y2)<<endl;
            
        }//cout<<ans<<endl;
        cout<<(ans+mod)%mod<<'\n';
    }
    return 0;
}