#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
using namespace std;
typedef long long LL;
const int N=2e6+3;
int gi() {
	int w=0;bool q=1;char c=getchar();
	while ((c<'0'||c>'9') && c!='-') c=getchar();
	if (c=='-') q=0,c=getchar();
	while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
	return q? w:-w;
}
const int mod=1e9+7;
int fac[N],inv[N];
inline int C(int x,int y) { return 1LL*fac[x+y]*inv[x]%mod*inv[y]%mod; }
inline int solve(int x1,int x2,int y1,int y2) { return ((LL)C(x2+1,y2+1)-C(x2+1,y1)-C(x1,y2+1)+C(x1,y1))%mod; }
int main()
{
	int i,ans=0;
	int x1=gi(),x2=gi(),x3=gi(),x4=gi(),x5=gi(),x6=gi();
	int y1=gi(),y2=gi(),y3=gi(),y4=gi(),y5=gi(),y6=gi();
	for (i=fac[0]=1;i<N;i++) fac[i]=1LL*fac[i-1]*i%mod;
	for (i=2,inv[0]=inv[1]=1;i<N;i++) inv[i]=-1LL*(mod/i)*inv[mod%i]%mod;
	for (i=3;i<N;i++) inv[i]=1LL*inv[i]*inv[i-1]%mod;

	for (i=x3;i<=x4;i++)
		ans=(ans+(-i-y3+1LL)*solve(i-x2,i-x1,y3-y2-1,y3-y1-1)%mod*solve(x5-i,x6-i,y5-y3,y6-y3))%mod;
	for (i=y3;i<=y4;i++)
		ans=(ans+(-x3-i+1LL)*solve(x3-x2-1,x3-x1-1,i-y2,i-y1)%mod*solve(x5-x3,x6-x3,y5-i,y6-i))%mod;
	for (i=y3;i<=y4;i++)
		ans=(ans+(i+x4+0LL)*solve(x4-x2,x4-x1,i-y2,i-y1)%mod*solve(x5-x4-1,x6-x4-1,y5-i,y6-i))%mod;
	for (i=x3;i<=x4;i++)
		ans=(ans+(i+y4+0LL)*solve(i-x2,i-x1,y4-y2,y4-y1)%mod*solve(x5-i,x6-i,y5-y4-1,y6-y4-1))%mod;
	printf("%d\n",(ans+mod)%mod);
	return 0;
}
