#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 


const int mod = 1000000007;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);

struct UnionFind {
    vector<int> par;
    vector<int> edge;
    
    UnionFind(int n) : par(n, -1),edge(n, 0) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};

mint calc(vl l,vl r){//それぞれの変数がl~rまで取れる時の、重複しない通り数
    ll n=l.size();
    vpl trans;
    rep(i,n)rep(j,i)trans.push_back({i,j});
    ll m=trans.size();
    mint ans=0;
    rep(bit,1<<m){
        UnionFind uf(n);
        rep(i,m)if(bit>>i&1)uf.merge(trans[i].first,trans[i].second);
        vpl ivs(n,{-INF,INF});
        rep(i,n){
            ll p=uf.root(i);
            chmax(ivs[p].first,l[i]);
            chmin(ivs[p].second,r[i]);
        }
        mint ret=1;
        rep(i,n){
            if(ivs[i].first==-INF)continue;
            ret*=max(0LL,ivs[i].second-ivs[i].first+1);
        }
        if(__builtin_popcount(bit)%2)ret*=-1;
        ans+=ret;
    }
    return ans;
}
int main(){
    vl a(7),b(7);rep(i,7)cin >> a[i] >> b[i];
    vl lx={a[0],a[2],a[4],a[6]};
    vl rx={b[0],b[2],b[4],b[6]};
    vl ly={a[1],a[3],a[5]};
    vl ry={b[1],b[3],b[5]};
    mint ans=0;
    mint left=0;
    for(ll i=1;i<=20000;i++){
        vl nry=ry;
        rep(j,3)chmin(nry[j],i);
        auto now=calc(ly,nry);
        vl nlx=lx;
        rep(j,4)chmax(nlx[j],i+1);
        ans+=(now-left)*calc(nlx,rx);
        left=now;
    }
    left=0;
    for(ll i=1;i<=20000;i++){
        vl nrx=rx;
        rep(j,4)chmin(nrx[j],i);
        auto now=calc(lx,nrx);
        vl nly=ly;
        rep(j,3)chmax(nly[j],i+1);
        ans+=(now-left)*calc(nly,ry);
        left=now;
    }
    cout << ans << endl;
}