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

const int MAX = 20010;
const ll MOD = 1e9 + 7;

int mini[10], maxi[10];
int perm[10], id[10];
int dp[MAX], dpS[MAX];

int solve(){
	bool ok = false;
	if(min({perm[1], perm[3], perm[5]}) > max({perm[0], perm[2], perm[4], perm[6]}))
		ok = true;
	if(max({perm[1], perm[3], perm[5]}) < min({perm[0], perm[2], perm[4], perm[6]}))
		ok = true;

	if(!ok)
		return 0;

	for(int i=0;i<7;i++)
		id[perm[i]] = i;

	memset(dp, 0, sizeof(dp));
	for(int i=mini[id[0]];i<=maxi[id[0]];i++)
		dp[i] = 1;

	for(int i=1;i<7;i++){
		int j = id[i];

		dpS[0] = 0;
		for(int k=1;k<MAX;k++){
			dpS[k] = dpS[k-1] + dp[k];
			if(dpS[k] >= MOD)dpS[k] -= MOD;
		}

		memset(dp, 0, sizeof(dp));
		for(int k=mini[j];k<=maxi[j];k++){
			dp[k] = dpS[k-1];
		}
	}

	int res = 0;
	for(int i=1;i<MAX;i++){
		res += dp[i];
		if(res >= MOD)res -= MOD;
	}

	return res;
}

int main(){
	for(int i=0;i<7;i++)
		cin >> mini[i] >> maxi[i];

	for(int i=0;i<7;i++)
		perm[i] = i;

	int res = 0;
	do {
		res += solve();
		if(res >= MOD)res -= MOD;
	} while(next_permutation(perm, perm + 7));

	cout << res << endl;
	return 0;
}