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

const int bdf  = (1 << 1) | (1 << 3) | (1 << 5);
const int aceg = ((1 << 7) - 1) ^ bdf;
const int MOD  = 1e9 + 7;

int low[10], high[10], dp[1<<8];

void add(int &a, int b){
	a += b;
	if(a >= MOD)
		a -= MOD;
}

int solve(int small, int big){
	memset(dp, 0, sizeof(dp));

	dp[0] = 1;
	for(int x=1;x<=20000;x++){
		for(int S=(1<<7)-1;S>0;S--){
			bool small_done = (S & small) == small;
			bool big_exist = (S & big) != 0;

			if(!small_done && big_exist)
				continue;

			for(int i=0;i<7;i++){
				if(!((S >> i) & 1))
					continue;

				if(((small >> i) & 1) && big_exist)
					continue;

				if(x < low[i] || high[i] < x)
					continue;

				add(dp[S], dp[S^(1<<i)]);
			}
		}
	}

	return dp[(1 << 7) - 1];
}

int main(){
	for(int i=0;i<8;i++)
		cin >> low[i] >> high[i];

	int res = solve(bdf, aceg) + solve(aceg, bdf);
	if(res >= MOD)
		res -= MOD;

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