/*Time:2024-08-31 16:42:53*/
	#include <bits/stdc++.h>

	#define pii pair<int,int>
	#define vi vector<int>
	#define vvi vector<vi>
	#define int long long
	using namespace std;
	const int MOD = (int) 1e9 + 7;
	const int MAXN = 200005;
	int a,b,x,y,xx,yy;
	int ksm(int a,int n){
	    int ans=1;
	    for(int i=0;i<=30;i++){
	        if(n&(1ll<<i))ans=ans*a%MOD;
	        a=a*a%MOD;
	    }
	    return ans;
	}
	void solve() {
		// if(xx<=a || yy<=b){
		// 	cout<<0<<endl;
		// 	return;
		// }
		
		int inv2=ksm(2,MOD-2);
		int ans = (1+a) * a % MOD * inv2 % MOD * (1+b) % MOD * b %MOD * inv2 %MOD;
		ans += (xx-x)*(yy-y)%MOD*a%MOD*b%MOD;
		ans%=MOD;
		if(a>x&&b>y){
			int l1=max(1ll,a-xx+1),r1=a-x;
			int l2=max(1ll,b-yy+1),r2=b-y;
			int k=(l2+r2)%MOD * (r2-l2+1) % MOD * inv2 % MOD * (l1+r1)%MOD * (r1-l1+1) % MOD * inv2 % MOD;
			ans=ans-k+MOD;
			// cout<<k<<endl;
			// cout<<l1<<" "<<r1<<" "<<l2<<" "<<r2<<" "<<endl;
			ans%=MOD;
		}
		
		
		// ans=ans*k%MOD;

		cout<<ans<<endl;
	}

	int32_t main() {
	    std::ios::sync_with_stdio(false);
	    std::cin.tie(nullptr);
	    int T = 1;

	    // cin >> T;
	    while (cin >> a >>b>>x>>xx>>y>>yy)solve();
	}