#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

ll fact_mod(ll n) {
    ll ret=1; 
    for(ll i=2;i<=n;i++) ret=ret*(i%mod)%mod;
    return ret;
} 
ll pow_mod(ll x, ll n){
    if(n==0) return 1;
    ll ret=pow_mod((x*x) % mod, n/2);
    if(n&1) ret=(ret*x)%mod;
    return ret;
}
//O(r)
ll combination_mod(ll n, ll r) {
    if(r>n-r) r=n-r;
    if(r==0) return 1;
    ll a=1;
    for(ll i=0;i<r;i++) a=a*((n-i)%mod)%mod;
    ll b=pow_mod(fact_mod(r), mod-2);
    return (a%mod)*(b%mod)%mod;
}
ll inv_mod(ll n){
    return pow_mod(n,mod-2);
}

ll p9(ll x, ll n){
    if(n==0) return 1;
    ll ret=pow_mod((x*x)%9, n/2);
    if(n&1) ret=(ret*x)%9;
    return ret;
}


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    ll l[n],r[n],d[n];
    rep(i,n) cin>>l[i];
    rep(i,n) cin>>r[i];
    rep(i,n) cin>>d[i];

    int st=0;
    bool plf=false;
    rep(i,n){
        if(d[i]) plf=true;
        else{
            if(plf){
                cout<<0<<endl;
                return 0;
            }
            st=i+1;
        }
    }
    

    ll ans=1,m9=0;
    ll i9=inv_mod(9);
    bool f=true;
    for(int i=st;i<n;i++){
        int need=(d[i]+9-m9)%9;
        ll k=(pow_mod(10,r[i])-1)*i9%mod;
        k+=mod-(pow_mod(10,l[i])-1)*i9%mod;
        k%=mod;
        if(need==0 and i!=st) k++;
        ans=ans*k%mod;
        m9=d[i]%9;
    }
    cout<<ans<<endl;
    return 0;
}