#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)


int mod = 1000000007;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
int MIN[7], MAX[7];
//-----------------------------------------------------------------------------------
int dp[8][20101];
int count(vector<int> v) {
    rep(i, 0, 8) rep(j, 0, 20101) dp[i][j] = 0;

    dp[0][0] = 1;
    rep(i, 1, 8) {
        int vi = v[i - 1];
        int sm = 0;
        rep(j, 0, MIN[vi]) sm = add(sm, dp[i - 1][j]);
        rep(j, MIN[vi], MAX[vi] + 1) {
            dp[i][j] = sm, sm = add(sm, dp[i - 1][j]);
        }
    }

    int res = 0;
    rep(j, 0, 20101) res = add(res, dp[7][j]);
    return res;
}
//-----------------------------------------------------------------------------------
int main() {
    rep(i, 0, 7) scanf("%d%d", &MIN[i], &MAX[i]);

    int ans = 0;

    vector<int> a({ 0,2,4,6 }), b({ 1,3,5 });
    do do {
            vector<int> v;
            copy(a.begin(), a.end(), back_inserter(v));
            copy(b.begin(), b.end(), back_inserter(v));
            ans = add(ans, count(v));
            v.clear();
            copy(b.begin(), b.end(), back_inserter(v));
            copy(a.begin(), a.end(), back_inserter(v));
            ans = add(ans, count(v));
    } while (next_permutation(b.begin(), b.end()));
      while (next_permutation(a.begin(), a.end()));

    cout << ans << endl;
}