#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << x << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
template<class T> using pque = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 };
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }
template<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

constexpr ll mod = mod1e9;
template <int mod> class modint {
public:
	int n;
	modint() : n(0) {};
	modint(ll n_) {
		n = n_ % mod;
		if (n < 0) n += mod;
	}
	modint operator -() const { return n > 0 ? mod - n : -n; }
	bool operator == (const modint &m) const { return n == m.n; }
	bool operator != (const modint &m) const { return n != m.n; }
	modint &operator += (const modint &m) { n += m.n; if (n >= mod) n -= mod; return *this; }
	modint &operator -= (const modint &m) { n -= m.n; if (n < 0) n += mod; return *this; }
	modint &operator *= (const modint &m) { n = ll(n) * m.n % mod; return *this; }
	modint &operator /= (const modint &m) { n = ll(n) * modinv(m).n % mod; return *this; }
	modint operator +(modint m) const { return modint(*this) += m; }
	modint operator -(modint m) const { return modint(*this) -= m; }
	modint operator *(modint m) const { return modint(*this) *= m; }
	modint operator /(modint m) const { return modint(*this) /= m; }
	modint &operator ++ () { *this += 1; return *this; }
	modint operator ++ (int) { *this += 1; return *this - 1; }
	modint &operator -- () { *this -= 1; return *this; }
	modint operator -- (int) { *this -= 1; return *this + 1; }
	modint pow(ll b) const {
		modint res = 1, a = modint(*this);
		while (b) {
			if (b & 1) res *= a;
			a *= a;
			b >>= 1;
		}
		return res;
	}
	friend istream &operator >> (istream &s, modint<mod> &a) { s >> a.n; return s; }
	friend ostream &operator << (ostream &s, modint<mod> &a) { s << a.n; return s; }
};

using mint = modint<mod>;
vector<mint> fac, inv, facinv;

mint modinv(mint x) {
	ll a = x.n;
	if (a == 0) abort();
	if (a < (ll)inv.size()) return inv[a];
	ll b = mod, u = 1, v = 0;
	while (b) {
		ll t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	mint res = u;
	return res;
}

void modcalc(int n) {
	fac.resize(n); inv.resize(n); facinv.resize(n);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < n; i++) {
		fac[i] = fac[i - 1] * i;
		inv[i] = -inv[mod % i] * (mod / i);
		facinv[i] = facinv[i - 1] * inv[i];
	}
}

mint comb(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[k] * facinv[n - k];
}

mint perm(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[n - k];
}

mint hom(ll n, ll k) {
	if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}

mint solve(ll xm, ll ym, ll xl, ll yl) {
	mint res = 0;
	mint now = comb(xm + ym, xm);
	for (int i = 0; i <= xl + yl + 1; i++) {
		res += now;
		if (i >= xl) now -= comb(i, xl) * comb(xm + ym - i - 1, xm - xl - 1);
		if (i >= yl) now -= comb(i, yl) * comb(xm + ym - i - 1, ym - yl - 1);
	}
	return res;
}

int main() {
	modcalc(3 * ten(6));
	vector<ll> x(6), y(6);
	cin >> x; cin >> y;
	vector<P> a(4), b(4);
	a[0] = { x[5] - x[2] + y[5] - y[2] + 2,x[5] - x[2] + 1 };
	a[1] = { x[4] - x[2] + y[4] - y[2],x[4] - x[2] };
	a[2] = { x[5] - x[2] + y[4] - y[2] + 1,x[5] - x[2] + 1 };
	a[3] = { x[4] - x[2] + y[5] - y[2] + 1,x[4] - x[2] };
	b[0] = { x[2] - x[0] + y[2] - y[0] + 2,x[2] - x[0] + 1 };
	b[1] = { x[2] - x[1] + y[2] - y[1],x[2] - x[1] };
	b[2] = { x[2] - x[0] + y[2] - y[1] + 1,x[2] - x[0] + 1 };
	b[3] = { x[2] - x[1] + y[2] - y[0] + 1,x[2] - x[1] };
	ll c = x[3] - x[2]; ll d = y[3] - y[2];
	mint ans = 0;
	rep(i, 4) {
		rep(j, 4) {
			mint sign = 1;
			if (i >= 2) sign *= -1;
			if (j >= 2) sign *= -1;
			vector<ll> p(4);
			p[0] = a[i].first;
			p[1] = a[i].second;
			p[2] = b[j].first;
			p[3] = b[j].second;
			mint res = 0;
			res += solve(p[0] + p[2] - p[1] - p[3], p[1] + p[3], p[2] - p[3] + d, p[3] + c);
			res += solve(p[0] + p[2] - p[1] - p[3], p[1] + p[3], p[2] - p[3] - 1, p[3] - 1);
			res -= solve(p[0] + p[2] - p[1] - p[3], p[1] + p[3], p[2] - p[3] + d, p[3] - 1);
			res -= solve(p[0] + p[2] - p[1] - p[3], p[1] + p[3], p[2] - p[3] - 1, p[3] + c);
			res *= sign;
			ans += res;
		}
	}
	cout << ans << '\n';
}

Measured memory_bytes: 38260