#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main()
{
    int n; cin>>n;
    ll l[100010], r[100010];
    int d[100010];
    for(int i=0; i<n; i++) cin>>l[i];
    for(int i=0; i<n; i++) cin>>r[i];
    for(int i=0; i<n; i++) cin>>d[i];
    int z=-1;
    for(int i=n-1; i>=0; i--){
        if(d[i]==0){
            z=i; break;
        }
    }
    for(int i=0; i<z; i++){
        if(d[i]!=0){
            cout<<0<<endl;
            return 0;
        }
    }
    if(z==n-1){
        cout<<1<<endl;
        return 0;
    }
    for(int i=n-1; i>=z+1; i--){
        d[i]%=9;
        if(i) d[i]=(d[i]+9-d[i-1])%9;
    }
    ll ans=1;
    ll myon=inv(9);
    for(int i=z+1; i<n; i++){
        ll c=(powmod(10, r[i])-powmod(10, l[i])+MOD)*myon%MOD;
        if(i>z+1 && d[i]==0) c++;
        (ans*=c)%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}