#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

#define N 7
#define M 20010
#define MD 1000000007

template<class T> T min(T a, T b, T c){return min(min(a,b),c);}
template<class T> T min(T a, T b, T c, T d){return min(min(a,b),min(c,d));}
template<class T> T max(T a, T b, T c){return max(max(a,b),c);}
template<class T> T max(T a, T b, T c, T d){return max(max(a,b),max(c,d));}

int mn[N], mx[N];
int dp[M], sum[M];

int main(){
  int i, j, k, ok;
  int ind[7], A[7], B[7];
  int res = 0;

  rep(i,N) ind[i] = i, reader(A+i, B+i);

  do{
    ok = 0;
    if( min(ind[1],ind[3],ind[5]) > max(ind[0],ind[2],ind[4],ind[6]) ) ok = 1;
    if( max(ind[1],ind[3],ind[5]) < min(ind[0],ind[2],ind[4],ind[6]) ) ok = 1;
    if(!ok) continue;

    rep(i,N) mn[ind[i]] = A[i], mx[ind[i]] = B[i];

    rep(i,M) dp[i] = 0;
    REP(i,mn[0],mx[0]+1) dp[i]++;
    REP(k,1,7){
      sum[0] = dp[0];
      REP(i,1,M){
        sum[i] = sum[i-1] + dp[i];
        if(sum[i] >= MD) sum[i] -= MD;
      }

      rep(i,M) dp[i] = 0;
      REP(i,mn[k],mx[k]+1) dp[i] = sum[i-1];
    }

    rep(i,M){
      res += dp[i];
      if(res >= MD) res -= MD;
    }
    
  }while(next_permutation(ind, ind+7));

  writerLn(res);

  return 0;
}