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

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M> struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) { if ((int)(v += b.v - mod) < 0) v += mod; return *this; }
  m& operator-=(m b) { if ((int)(v -= b.v) < 0) v += mod; return *this; }
  m& operator*=(m b) { v = (uint64_t)v * b.v % mod; return *this; }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<power(10, 9) + 7>;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<long long> l(n), r(n);
  vector<int> d(n);
  for (auto&& e : l) cin >> e;
  for (auto&& e : r) cin >> e;
  for (auto&& e : d) cin >> e;
  for (int i = 1; i < n; ++i) {
    if (d[i - 1] and d[i] == 0) {
      cout << "0\n";
      exit(0);
    }
  }
  {
    int p = 0;
    while (p < n and d[p] == 0) {
      ++p;
    }
    l.erase(begin(l), begin(l) + p);
    r.erase(begin(r), begin(r) + p);
    d.erase(begin(d), begin(d) + p);
    n = size(l);
  }
  mint res = 1;
  for (int i = 0; i < n; ++i) {
    int diff = d[i];
    if (i) {
      diff -= d[i - 1];
      diff += 9;
      diff %= 9;
    }
    res *= (power<mint>(10, r[i]) - power<mint>(10, l[i])) / 9 + (diff == 0);
    if (diff == 0 and i == 0) {
      res -= 1;
    }
  }
  cout << res.v << '\n';
}