#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}

bool B(int x,int i){
	return (x>>i)&1;
}


template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;

const int MX = 2100000;
mint f[MX];
mint g[MX];
mint Bin(int a,int b){
	return f[a+b]*g[a]*g[b];
}

void precalc(){
	f[0] = 1;
	rep1(i,MX-1) f[i] = f[i-1]*i;
	rep(i,MX) g[i] = f[i].inv();
}

mint solve2(int bx,int by,int tx,int ty){
	mint res = 0;
	rep(t,2){
		rep(x,bx+1){
			mint tmp = Bin(x,by) * Bin(tx-x,ty-by-1) * (x+by+1);
			res += tmp;
		}
		swap(bx,by);
		swap(tx,ty);
	}
	return res;
}

mint solve(int sx,int sy,int tx,int ty,int lx,int rx,int ly,int ry){
	tx -= sx;
	lx -= sx;
	rx -= sx;
	ty -= sy;
	ly -= sy;
	ry -= sy;
	mint res = 0;
	rep(c,4){
		int cx = B(c,0) ? rx : lx-1;
		int cy = B(c,1) ? ry : ly-1;
		bool ism = B(c,0)^B(c,1);
		mint tmp = solve2(cx,cy,tx,ty);
		if(ism) res -= tmp;
		else res += tmp;
	}
	return res;
}

int main(){
	precalc();
	
	int X[6],Y[6];
	rep(i,6) cin>>X[i];
	rep(i,6) cin>>Y[i];

	mint ans = 0;

	rep(a,4) rep(b,4){
		int ax = B(a,0) ? X[1] : X[0]-1;
		int ay = B(a,1) ? Y[1] : Y[0]-1;
		int bx = B(b,0) ? X[4] : X[5]+1;
		int by = B(b,1) ? Y[4] : Y[5]+1;
		bool ism = B(a,0)^B(a,1)^B(b,0)^B(b,1);
		mint tmp = solve(ax,ay,bx,by,X[2],X[3],Y[2],Y[3]);
		if(ism) ans -= tmp;
		else ans += tmp;
	}
	cout<<ans<<endl;
}


Measured memory_bytes: 16640