#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v, w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 2;

int aceg = 85, bdf = 42;

int solve(vector<int>& lb, vector<int>& ub, int mask1, int mask2) {
	vector<ll> dp(1 << 7);
	dp[0] = 1;
	for (int x = 0; x < 20000; x++) {
		vector<ll> _dp = dp;
		for (int S = 0; S < (1 << 7); S++) {
			if ((S & mask1) != mask1 && (S & mask2)) continue;
			for (int i = 0; i < 7; i++)
				if (!(S & (1 << i)) && x >= lb[i] && x < ub[i]) {
					int T = S | (1 << i);
					_dp[T] = (_dp[T] + dp[S]) % MOD;
				}
		}
		dp = _dp;
	}
	return dp[(1 << 7) - 1];
}

int main() {
	vector<int> lb(7), ub(7);
	for (int i = 0; i < 7; i++) {
		cin >> lb[i] >> ub[i];
		lb[i]--;
	}
	cout << (solve(lb, ub, aceg, bdf) + solve(lb, ub, bdf, aceg)) % MOD << endl;
}