#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = (int)1e9+7;

int minv[7],maxv[7],p[7],q[7];
int dp[7][20001];

int solve(){
    if( min(min(p[1],p[3]),p[5]) <= max(max(p[0],p[2]),max(p[4],p[6])) &&
        max(max(p[1],p[3]),p[5]) >= min(min(p[0],p[2]),min(p[4],p[6]))) return 0;
    REP(i,7) q[p[i]] = i;

    memset(dp, 0, sizeof(dp));
    REP(i,7){
        int j = q[i];
        if(i == 0){
            for(int k = minv[j]; k <= maxv[j]; k++) dp[i][k] = 1;
            continue;
        }
        for(int k = minv[j]; k <= maxv[j]; k++){
            if(k == minv[j]){
                for(int l = 1; l < k; l++)
                    dp[i][k] = (dp[i][k] + dp[i-1][l]) % MOD;
                continue;
            }
            dp[i][k] = (dp[i][k-1] + dp[i-1][k-1]) % MOD;
        }
    }
    int res = 0;
    REP(i,20001) res = ((ll)res + dp[6][i]) % MOD;
    return res;
}

int main(){
    REP(i,7){ cin >> minv[i] >> maxv[i]; p[i] = i; }
    ll sum = 0;
    do { sum = (sum + solve() ) % MOD; } while(next_permutation(p,p+7));
    cout << sum << endl;
}