#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int MOD = (int)1e9 + 7;
void sadd(int &a, int b){
    a += b;
    if(a >= MOD)a -= MOD;
    else if(a < 0)a += MOD;
}
int mul(int a, int b){
    return (int)((long long)a*b%MOD);
}

const int R = (int)2e4;
int mi[7], ma[7], dp[5][R + 3];

vi f(vi idx, int flag){
    vi res(R + 1);
    do{
        MEM(dp, 0);
        if(!flag)dp[0][0] = 1;
        else dp[0][R + 1] = 1;
        rep(i, sz(idx)){
            rep(j, R + 2)if(dp[i][j]){
                int k = idx[i], l = mi[k], r = ma[k];
                if(!flag)smax(l, j + 1);
                else smin(r, j - 1);
                if(l > r)continue;
                sadd(dp[i + 1][l], dp[i][j]);
                sadd(dp[i + 1][r + 1], -dp[i][j]);
            }
            rep(j, R + 1)sadd(dp[i + 1][j + 1], dp[i + 1][j]);
        }
        rep(i, R + 1)sadd(res[i], dp[sz(idx)][i]);
    } while(next_permutation(all(idx)));
    return res;
}

int main(){
    rep(i, 7)cin >> mi[i] >> ma[i];
    vi A, B, C, D;
    A = f(vi{1,3,5}, 0);
    B = f(vi{0,2,4,6}, 1);
    C = f(vi{1,3,5}, 1);
    D = f(vi{0,2,4,6}, 0);

    int ans = 0;
    rep(i, R)sadd(A[i + 1], A[i]);
    FOR(i, 1, R + 1)sadd(ans, mul(A[i - 1], B[i]));
    rep(i, R)sadd(D[i + 1], D[i]);
    rep(i, R)sadd(ans, mul(D[i], C[i + 1]));
    cout << ans << endl;
}