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

const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
    a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
    a = a*b % MOD;
}

int64_t power_mod(int64_t num, int64_t power){
    int64_t prod = 1;
    num %= MOD;
    while(power > 0){
        if(power&1) prod = prod * num % MOD;
        num = num * num % MOD;
        power >>= 1;
    }
    return prod;
}

int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
    int64_t d = a;
    if(b != 0){
        d = extgcd(b, a%b, y, x);
        y -= (a/b) * x;
    }else{
        x = 1; y = 0;
    }
    return d;
}

int64_t inv_mod(int64_t a){
    int64_t x, y;
    extgcd(a, MOD, x, y);
    return (MOD + x%MOD) % MOD;
}

vector<int64_t> fact, fact_inv;

void create_mod_tables(int num){
    fact.assign(num+1, 1);
    fact_inv.assign(num+1, 1);
    for(int i=1; i<=num; i++) fact[i] = fact[i-1] * i % MOD;
    fact_inv[num] = inv_mod(fact[num]);
    for(int i=num; i>0; i--) fact_inv[i-1] = fact_inv[i] * i % MOD;
}

int64_t comb_mod(int n, int k){
    return fact[n] * fact_inv[n-k] % MOD * fact_inv[k] % MOD;
}

int64_t perm_mod(int n, int k){
    return fact[n] * fact_inv[n-k] % MOD;
}

int main(){
    int N;
    cin >> N;
    vector<int64_t> L(N), R(N);
    for(int i=0; i<N; i++) cin >> L[i];
    for(int i=0; i<N; i++) cin >> R[i];    
    vector<int> D(N);
    for(int i=0; i<N; i++) cin >> D[i];

    static int64_t dp[100001][2];
    dp[0][0] = 1;
    for(int i=0; i<N; i++){
        if(D[i] == 0){
            dp[i+1][0] = dp[i][0];
        }else{
            int64_t v = (power_mod(10, R[i]) - power_mod(10, L[i]) + MOD) * inv_mod(9) % MOD;
            if(i && D[i-1] == D[i]) add(v, 1);
            dp[i+1][1] = v * (dp[i][0] + dp[i][1]) % MOD;
            
        }
    }

    int64_t ans = dp[N][0] + dp[N][1];
    cout << ans << endl;
    return 0;
}