#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

constexpr ll mod = 1e9+7;
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    
    friend ostream &operator<<(ostream& os,const mint& a){
        return os << a.x;
    }

    friend istream &operator>>(istream& is,mint& a){
        ll t;
        is >> t;
        a = mint(t);
        return (is);
    }

    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 {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // 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 {
        mint res(*this);
        return res/=a;
    }
};

const int M = 9;

using arr = array<array<mint,M>,M>;

arr e{};

arr mult(arr& A,arr& B){
    arr C{};
    for(int i=0;i<M;i++) for(int k=0;k<M;k++) for(int j=0;j<M;j++) C[i][j] += A[i][k]*B[k][j];
    return C;
}

arr pow(arr& A,ll n){
    if(!n) return e;
    arr P = pow(A,n>>1);
    P = mult(P,P);
    if(n&1) P = mult(P,A);
    return P;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    for(int i=0;i<M;i++) for(int j=0;j<M;j++) e[i][j] = i==j;
    arr X;
    for(int i=0;i<M;i++) for(int j=0;j<M;j++) X[i][j] = (i==j? 2:1);
    int N;
    cin >> N;
    vec<ll> L(N),R(N);
    vec<int> D(N);
    for(auto& x:L) cin >> x;
    for(auto& x:R) cin >> x;
    for(auto& x:D) cin >> x;
    int zero = count(D.begin(),D.end(),0);
    if(zero){
        cout << (zero==N? 1:0) << "\n";
        return 0;
    }
    mint ans = 1;
    int now = 0;
    vec<arr> dp(60);
    for(int i=0;i<60;i++) dp[i] = pow(X,1LL<<i);


    auto calc = [&](ll l,ll r,int d)->mint{
        auto R = e;
        for(int i=0;i<60;i++) if(r>>i&1) R = mult(R,dp[i]);
        auto L = e;
        for(int i=0;i<60;i++) if(l>>i&1) L = mult(L,dp[i]);
        return R[d][d]-L[d][d];
    };

    for(int i=0;i<N;i++){
        int ne = (D[i]-now+M)%M;
        if(ne) ans *= calc(L[i],R[i],ne);
        else{
            if(!i) ans *= calc(L[i],R[i],ne);
            else ans *= calc(L[i],R[i],ne)+1;
        }
        now = D[i];
    }
    cout << ans << "\n";
}