#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define Buff ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;

inline ll Qpower(ll x, ll y)
{
	ll z = 1;
	while(y > 0)
	{
		if(y & 1)
			z = (z * x) % mod;
		y >>= 1;
		x = (x * x) % mod;
	}
	return z;
}



inline ll C(ll n, ll m)
{
	static ll md = Qpower(2, mod - 2);
	ll n1 = n + 1;
	ll n2 = (n1 % mod) * (n % mod) % mod;
	n2 *= md;
	n2 %= mod;

	ll m1 = m + 1;
	ll m2 = (m1 % mod) * (m % mod) % mod;
	m2 *= md;
	m2 %= mod;

	m2 = n2 * m2 % mod;
	return m2;
}

void solve()
{
	ll a, b, x1, x2, y1, y2;

	while(cin >> a >> b >> x1 >> x2 >> y1 >> y2)
	{
		ll ans = C(a, b);

		ans = (ans + ((a * b % mod) * (x2 - x1) % mod * (y2 - y1) % mod)) % mod;

		if(x1 < a && y1 < b)
		{
			ll x = a - x1;
			ll y = b - y1;
			ll d = C(x, y);
			ans = (ans - d + mod) % mod;
			if(a > x2)
			{
				ll xx = a - x2;
				ll d1 = C(xx, y);
				ans = (ans + d1) % mod;
			}
			if(b > y2)
			{
				ll yy = b - y2;
				ll d2 = C(x, yy);
				ans = (ans + d2) % mod;
				if(a > x2)
				{
					ll x3 = a - x2;
					ll d3 = C(x3, yy);
					ans = (ans - d3 + mod) % mod;
				}
			}
		}
		cout << ans << "\n";
	}
}

int main()
{
	Buff;
	int N = 1;
	//cin >> N;
	while(N--)
		solve();
	return 0;
}