#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

constexpr ll mod = 1e9+7;
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    
    friend ostream &operator<<(ostream& os,const mint& a){
        return os << a.x;
    }

    friend istream &operator>>(istream& is,mint& a){
        ll t;
        is >> t;
        a = mint(t);
        return (is);
    }

    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vec<ll> L(N),R(N);
    vec<int> D(N);
    for(auto& x:L) cin >> x;
    for(auto& x:R) cin >> x;
    for(auto& x:D) cin >> x;
    mint ans = 1;
    int now = 0;

    auto calc = [&](ll l,ll r)->mint{
        mint ten = 10;
        return (ten.pow(r)-ten.pow(l))/(ten-1);
    };

    bool nonzero = false;
    for(int i=0;i<N;i++){
        if(!D[i] && nonzero){
            cout << 0 << "\n";
            return 0;
        }
        int ne = (D[i]-now+9)%9;
        if(ne) ans *= calc(L[i],R[i]);
        else{
            if(D[i]) ans *= calc(L[i],R[i])+1;
        }
        now = D[i];
        if(D[i]) nonzero = true;
    }
    cout << ans << "\n";
}