#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll solve(vector<int> l, vector<int> r){
  int m=l.size();
  vector<int> v(2*m);
  for(int i=0; i<m; i++){
    if(l[i]>=r[i]) return 0;
    v[2*i]=l[i], v[2*i+1]=r[i];
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  int n=v.size();
  for(int i=0; i<m; i++){
    l[i]=lower_bound(v.begin(), v.end(), l[i])-v.begin();
    r[i]=lower_bound(v.begin(), v.end(), r[i])-v.begin();
  }
  int a[5];
  ll ret=0;
  auto dfs=[&](auto dfs, int k)->void{
    if(k==m){
      int cnt[10]={};
      for(int i=0; i<m; i++){
        cnt[a[i]]++;
      }
      ll p=1;
      for(int i=0; i<n-1; i++){
        for(int j=0; j<cnt[i]; j++){
          p*=(v[i+1]-v[i]-j);
          p%=MOD;
        }
      }
      ret+=p;
      if(ret>=MOD) ret-=MOD;
      return;
    }
    for(int i=l[k]; i<r[k]; i++){
      a[k]=i;
      dfs(dfs, k+1);
    }
  };
  dfs(dfs, 0);
  return ret;
}
int main()
{
	int a[7], b[7];
  for(int i=0; i<7; i++) cin>>a[i]>>b[i];
  ll ans=0;
  for(int i=2; i<=20000; i++){
    vector<int> l(3), r(3);
    for(int j=0; j<3; j++){
      l[j]=max(i, a[2*j+1]);
      r[j]=b[2*j+1]+1;
    }
    ll s=solve(l, r);
    for(int j=0; j<3; j++){
      l[j]=max(i+1, a[2*j+1]);
      r[j]=b[2*j+1]+1;
    }
    s=(s-solve(l, r)+MOD)%MOD;
    if(s==0) continue;
    l.resize(4); r.resize(4);
    for(int j=0; j<4; j++){
      l[j]=a[2*j];
      r[j]=min(i, b[2*j]+1);
    }
    (s*=solve(l, r))%=MOD;
    (ans+=s)%=MOD;
  }
  for(int i=2; i<=20000; i++){
    vector<int> l(4), r(4);
    for(int j=0; j<4; j++){
      l[j]=max(i, a[2*j]);
      r[j]=b[2*j]+1;
    }
    ll s=solve(l, r);
    for(int j=0; j<4; j++){
      l[j]=max(i+1, a[2*j]);
      r[j]=b[2*j]+1;
    }
    s=(s-solve(l, r)+MOD)%MOD;
    if(s==0) continue;
    l.resize(3); r.resize(3);
    for(int j=0; j<3; j++){
      l[j]=a[2*j+1];
      r[j]=min(i, b[2*j+1]+1);
    }
    (s*=solve(l, r))%=MOD;
    (ans+=s)%=MOD;
  }
  cout<<ans<<endl;
	return 0;
}