#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }


template<int MOD>
struct ModInt {
	static const int Mod = MOD;
	unsigned x;
	ModInt() : x(0) {}
	ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	int get() const { return (int)x; }

	ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }

	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
};
typedef ModInt<1000000007> mint;

int main() {
	const int N = 7;
	vector<int> L(N);
	vector<int> R(N);
	for(int i = 0; i < N; ++ i)
		scanf("%d%d", &L[i], &R[i]);
	int X = *max_element(all(R));
	mint ans;
	rep(kind, 2) {
		vector<vector<mint> > dp(1 << N, vector<mint>(X + 2));
		dp[0][0] = 1;
		rep(i, 1 << N) {
			rer(k, 0, X)
				dp[i][k + 1] += dp[i][k];
			int p = 0;
			rep(j, N)
				p += i >> j & 1;
			if(kind == 0) {
				if(p == 3 && i != (1 << 1 | 1 << 3 | 1 << 5))
					continue;
			} else {
				if(p == 4 && i != (1 << 0 | 1 << 2 | 1 << 4 | 1 << 6))
					continue;
			}
			rer(k, 0, X) {
				mint x = dp[i][k];
				if(x.x == 0) continue;
				rep(j, N) if((~i >> j & 1) && L[j] <= k && k <= R[j])
					dp[i | 1 << j][k + 1] += x;
			}
		}
		ans += dp[(1 << N)-1][X+1];
	}
	printf("%d\n", ans.get());
	return 0;
}