#include <bits/stdc++.h>
using namespace std;

template <int MOD_> struct modnum {
	static constexpr int MOD = MOD_;
	static_assert(MOD_ > 0, "MOD must be positive");

private:
	using ll = long long;

	int v;

	static int minv(int a, int m) {
		a %= m;
		assert(a);
		return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);
	}

public:

	modnum() : v(0) {}
	modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
	explicit operator int() const { return v; }
	friend std::ostream& operator << (std::ostream& out, const modnum& n) { return out << int(n); }
	friend std::istream& operator >> (std::istream& in, modnum& n) { ll v_; in >> v_; n = modnum(v_); return in; }

	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }

	modnum inv() const {
		modnum res;
		res.v = minv(v, MOD);
		return res;
	}
	friend modnum inv(const modnum& m) { return m.inv(); }
	modnum neg() const {
		modnum res;
		res.v = v ? MOD-v : 0;
		return res;
	}
	friend modnum neg(const modnum& m) { return m.neg(); }

	modnum operator- () const {
		return neg();
	}
	modnum operator+ () const {
		return modnum(*this);
	}

	modnum& operator ++ () {
		v ++;
		if (v == MOD) v = 0;
		return *this;
	}
	modnum& operator -- () {
		if (v == 0) v = MOD;
		v --;
		return *this;
	}
	modnum& operator += (const modnum& o) {
		v += o.v;
		if (v >= MOD) v -= MOD;
		return *this;
	}
	modnum& operator -= (const modnum& o) {
		v -= o.v;
		if (v < 0) v += MOD;
		return *this;
	}
	modnum& operator *= (const modnum& o) {
		v = int(ll(v) * ll(o.v) % MOD);
		return *this;
	}
	modnum& operator /= (const modnum& o) {
		return *this *= o.inv();
	}

	friend modnum operator ++ (modnum& a, int) { modnum r = a; ++a; return r; }
	friend modnum operator -- (modnum& a, int) { modnum r = a; --a; return r; }
	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
};

template <typename T> T pow(T a, long long b) {
	assert(b >= 0);
	T r = 1; while (b) { if (b & 1) r *= a; b >>= 1; a *= a; } return r;
}

using num = modnum<int(1e9)+7>;

vector<num> fact;
vector<num> ifact;

void precomp() {
	const int V = 2.1e6;
	fact = vector<num>(V);
	fact[0] = 1;
	for (int i = 1; i < V; i++) {
		fact[i] = fact[i-1] * i;
	}

	ifact = vector<num>(V);
	ifact.back() = inv(fact.back());
	for (int i = V-1; i >= 1; i--) {
		ifact[i-1] = ifact[i] * i;
	}
}

num binom(int a, int b) {
	assert(min(a, b) >= 0);
	assert(a+b < int(fact.size()));
	return fact[a+b] * ifact[a] * ifact[b];
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);

	precomp();

	int X[6];
	for (int i = 0; i < 6; i++) cin >> X[i];
	int Y[6];
	for (int i = 0; i < 6; i++) cin >> Y[i];

	X[0] --, Y[0] --;
	X[5] ++, Y[5] ++;

	num ans = 0;
	for (int a = 0; a < 2; a++) {
		for (int b = 0; b < 2; b++) {
			for (int c = 0; c < 2; c++) {
				for (int d = 0; d < 2; d++) {
					num curval = 0;

					for (int x = X[2]; x <= X[3]; x++) {
						curval -= (x + Y[2]) * binom(x - X[0+a], Y[2] - Y[0+b] - 1) * binom(X[4+c] - x, Y[4+d] - Y[2]);
						curval += (x + Y[3] + 1) * binom(x - X[0+a], Y[3] - Y[0+b]) * binom(X[4+c] - x, Y[4+d] - Y[3] - 1);
					}
					for (int y = Y[2]; y <= Y[3]; y++) {
						curval -= (X[2] + y) * binom(X[2] - X[0+a] - 1, y - Y[0+b]) * binom(X[4+c] - X[2], Y[4+d] - y);
						curval += (X[3] + y + 1) * binom(X[3] - X[0+a], y - Y[0+b]) * binom(X[4+c] - X[3] - 1, Y[4+d] - y);
					}

					if (a^b^c^d) {
						ans -= curval;
					} else {
						ans += curval;
					}
				}
			}
		}
	}

	cout << ans << '\n';

	return 0;
}


Measured memory_bytes: 16640