#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#pragma warning(disable:4996) 

typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

ll mpow(ll x, ll n){ //x^n(mod M)
    ll ans = 1;
    while(n != 0){
        if(n&1) ans = ans*x % MOD;
        x = x*x % MOD;
        n = n >> 1;
    }
    return ans;
}

ll minv(ll x){
    return mpow( x, MOD-2 );
}

void solve()
{
    int n;
    scanf("%d", &n);
    vector<ll> L(n), R(n);
    vector<int> D(n);
    int i;
    for (i = 0; i < n; i++) {
        scanf("%lld", &L[i]);
    }
    for (i = 0; i < n; i++) {
        scanf("%lld", &R[i]);
    }
    for (i = 0; i < n; i++) {
        scanf("%d", &D[i]);
    }

    int cnt0 = 0;
    for (i = 0; i < n; i++) {
        if (D[i] == 0) cnt0++;
    }
    if (cnt0 == n) {
        printf("1\n"); return;
    }

    ll ans = 1;
    int prev = -1;
    for (i = 0; i < n; i++) {
        if (D[i] == 0) {
            if (prev!=-1) {
                printf("0\n"); return;
            }
        }
        else {
            D[i] %= 9;
            int add = (D[i] - prev + 9) % 9;
            if (prev < 0) {
                add = D[i] % 9;
            }
            ll ans0 = mpow(10, (R[i] % (MOD - 1)));
            ll ans1 = mpow(10, (L[i] % (MOD - 1)));
            ans0 = (ans0 - ans1 + MOD) % MOD * minv(9) % MOD;
            if (add == 0) {
                ans0 = (ans0 + 1) % MOD;
            }
            if (prev == 0 && D[i]==0) {
                ans0 = (ans0 - 1 + MOD) % MOD;
            }
            ans = ans * ans0%MOD;

            prev = D[i];
        }
    }
    printf("%lld\n", ans);

    return;
}


int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        //printf("Case #%d: ", t+1);
        solve();
    }
#endif
    return 0;
}