/* -*- coding: utf-8 -*-
 *
 * 1086.cc:  No.1086 桁和の桁和2 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

ll ls[MAX_N], rs[MAX_N];
int ds[MAX_N];

/* subroutines */

inline int powmod(int a, ll n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

inline int fcs(ll n) {
  return (ll)(powmod(10, n) + MOD - 1) % MOD * powmod(9, MOD - 2) % MOD;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%lld", ls + i);
  for (int i = 0; i < n; i++) scanf("%lld", rs + i);
  for (int i = 0; i < n; i++) scanf("%d", ds + i);

  int ans = 1, pd = 0;
  for (int i = 0; i < n; i++) {
    if (ds[i] == 0) {
      if (pd != 0) {
	puts("0");
	return 0;
      }
    }
    else {
      int fc = (fcs(rs[i]) + MOD - fcs(ls[i])) % MOD;
      if (pd == ds[i]) fc++;
      else pd = ds[i];
      ans = (ll)ans * fc % MOD;
    }
  }

  printf("%d\n", ans);
  return 0;
}