#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

vector<mint> ika(vector<int> mini,vector<int> maxi){
	int n = mini.size();
	vector dp(20001,vector(1<<n,vector<mint>(2,0)));
	dp[0][0][0] = 1;
	for(int i=0;i<20000;i++){
		rep(j,1<<n){
			rep(k,2){
				dp[i+1][j][0] += dp[i][j][k];
				
				rep(l,n){
					if((j>>l)&1)continue;
					if(mini[l]<=i+1&&i+1<=maxi[l]){
						dp[i+1][j|(1<<l)][1] += dp[i][j][k];
					}
				}
				
			}
		}
	}
	vector<mint> ret(20001,0);
	rep(i,dp.size()){
		ret[i] += dp[i][(1<<n)-1][1];
	}
	return ret;
}

vector<mint> more(vector<int> mini,vector<int> maxi){
	int n = mini.size();
	vector dp(20001,vector(1<<n,vector<mint>(2,0)));
	dp.back()[0][0] = 1;
	for(int i=20000;i>=1;i--){
		rep(j,1<<n){
			rep(k,2){
				dp[i-1][j][0] += dp[i][j][k];
				
				rep(l,n){
					if((j>>l)&1)continue;
					if(mini[l]<=i&&i<=maxi[l]){
						dp[i-1][j|(1<<l)][1] += dp[i][j][k];
					}
				}
				
			}
		}
	}
	vector<mint> ret(20001,0);
	rep(i,dp.size()){
		rep(j,2){
			ret[i] += dp[i][(1<<n)-1][j];
		}
	}
	return ret;
}


int main(){
	
	vector<int> m(7),M(7);
	rep(i,7)cin>>m[i]>>M[i];
	
	vector<int> x = {m[0],m[2],m[4],m[6]};
	vector<int> y = {M[0],M[2],M[4],M[6]};
	vector<int> z = {m[1],m[3],m[5]};
	vector<int> w = {M[1],M[3],M[5]};
	
	auto a = ika(x,y);
	auto b = more(z,w);
	auto c = more(x,y);
	auto d = ika(z,w);
	
	mint ans = 0;
	rep(i,a.size()){
		ans += a[i] * b[i];
		ans += c[i] * d[i];
	}
	
	cout<<ans.val()<<endl;
	
	return 0;
}