#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define all(a) (a).begin(), (a).end() #define bit32(x) (1 << (x)) #define bit64(x) (1ll << (x)) #define sz(v) ((int) v.size()) using namespace std; using i64 = long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vf80 = vector; using vstr = vector; void yes() { cout << "Yes" << endl; exit(0); } void no() { cout << "No" << endl; exit(0); } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template void amax(T &x, T y) { x = max(x, y); } template void amin(T &x, T y) { x = min(x, y); } template T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template istream& operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } const int INF = 1001001001; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; template struct ModInt { int x; ModInt(): x(0) {} ModInt(long long a) { x = a % mod; if (x < 0) x += mod; } ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; } ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; } ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt inverse() { int a = x, b = mod, u = 1, v = 0; while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); } return ModInt(u); } #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; } op(+, +=) op(-, -=) op(*, *=) op(/, /=) #undef op friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; } }; using mint = ModInt<1000000007>; void solve() { int n; cin >> n; vi64 L(n), R(n), D(n); cin >> L >> R >> D; vi32 d(n); d[0] = D[0]; reps(i, n - 1) { if (D[i-1] < D[i]) d[i]=D[i]-D[i-1]; if (D[i-1] > D[i]) d[i]=(D[i]+D[i-1]+1)%10; } int now = 0; mint ans = 1; rep(i, n) { if (now == 0 && d[i] == 0) { continue; } mint a = exp((mint) 10, L[i]); mint r = 10; i64 n = R[i] - L[i]; mint t = (a * exp(r, n) - a) / (r - 1); if (d[i] == 0) { t += 1; } ans *= t; now += d[i]; } cout << ans << endl; }