#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

long long modpow(long long x, long long n) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = (ret * x) % MOD;  
        x = (x * x) % MOD;
        n >>= 1;  
    }
    return ret;
}

long long inverse(long long x){
    return modpow(x,MOD-2);
}

int main(){
    int n;
    cin >> n;
    vector<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];

    vector<ll> dp(n+1,0);
    dp[0] = 1;

    ll inv9 = inverse(9);
    for(int i=1;i<=n;i++){
        if(i==1){
            if(d[i-1]==0){
                dp[i] = dp[i-1];
                continue;
            }
        }else{
            if(d[i-1]==0 && d[i-2]>0){
                cout << 0 << endl;
                return 0;
            }else if(d[i-1]==0){
                dp[i] = dp[i-1];
                continue;
            }
        }
        ll res = ((modpow(10,r[i-1]) - modpow(10,l[i-1]) + MOD) * inv9)%MOD;
        if(d[i-1]==d[i-2]) ++ res;
        dp[i] = (dp[i-1] * res)%MOD;
    }
    cout << dp[n] << endl;
    return 0;
}