// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-9;
const long double INF=1e+10;
const long double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
int X[6];
int Y[6];
long long P[2100000];
long long F(int a,int b,int c,int d){
	if(a>0)return 0;
	for(int i=0;i<2100000;i++)P[i]=0;
	for(int i=0;i<=c;i++){
		P[i]=Comb(c,i)*Comb(d,2-a-b-i)%mod;
	}
	for(int i=0;i<2;i++){
		for(int j=1;j<2100000;j++){
			P[j]=(P[j-1]+P[j])%mod;
		}
	}
	// printf("F %d %d %d %d: %lld\n",a,b,c,d,P[-a]);
	return P[-a];
}
long long f2(int a,int b,int c,int d,int e,int f){
	long long ret=0;
	ret=(ret+mod-F(1-a,-e-c,a+b,c+d+e+f+2))%mod;
	ret=(ret+mod+F(-e-a,-e-c+e+1,a+b+e+1,c+d+e+f+1-e))%mod;
	ret=(ret+mod+F(1-a,-e-c,a+b+f+1,c+d+e+f-f+1))%mod;
	ret=(ret+mod-F(-a-e,-e-c+e+1,a+b+f+1+e+1,c+d+e+f-f-e))%mod;
	// printf("f2 %d %d %d %d %d %d: %lld\n",a,b,c,d,e,f,ret);
	return ret;
}
long long f1(int a,int b,int c,int d){
	long long ret=0;
	ret=(ret+f2(a,b,X[5]-X[3]+1,Y[5]-Y[3]+1,c,d))%mod;
	ret=(ret+mod-f2(a,b,X[5]-X[3]+1,Y[4]-Y[3],c,d))%mod;
	ret=(ret+mod-f2(a,b,X[4]-X[3],Y[5]-Y[3]+1,c,d))%mod;
	ret=(ret+f2(a,b,X[4]-X[3],Y[4]-Y[3],c,d))%mod;
	// printf("f1 %d %d %d %d: %lld\n",a,b,c,d,ret);
	return ret;
}
int main(){
	init_C(3100000);
	for(int i=0;i<6;i++)scanf("%d",X+i);
	for(int i=0;i<6;i++)scanf("%d",Y+i);
	long long ret=0;
	ret=(ret+f1(X[2]-X[0]+1,Y[2]-Y[0]+1,X[3]-X[2],Y[3]-Y[2]))%mod;
	ret=(ret+mod-f1(X[2]-X[0]+1,Y[2]-Y[1],X[3]-X[2],Y[3]-Y[2]))%mod;
	ret=(ret+mod-f1(X[2]-X[1],Y[2]-Y[0]+1,X[3]-X[2],Y[3]-Y[2]))%mod;
	ret=(ret+f1(X[2]-X[1],Y[2]-Y[1],X[3]-X[2],Y[3]-Y[2]))%mod;
	
	printf("%lld\n",ret);
}

Measured memory_bytes: 89216