#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modsub(long long a, long long b){
	a %= MOD;
	b %= MOD;
	if (a >= b){
		return (a - b) % MOD;
	} else {
		return MOD - (b - a) % MOD;
	}
}
long long modpow(long long a, long long b){
	a %= MOD;
	long long res = 1;
	while (b > 0){
		if (b % 2 == 1) res = res * a % MOD;
		a = a * a % MOD;
		b = b / 2;
	}
	return res;
}
long long modinv(long long a){
	return modpow(a, MOD - 2);
}
long long modrepunit(long long x){
  return modsub(modpow(10, x), 1) * modinv(9) % MOD;
}
int main(){
  int N;
  cin >> N;
  vector<long long> L(N);
  for (int i = 0; i < N; i++){
    cin >> L[i];
  }
  vector<long long> R(N);
  for (int i = 0; i < N; i++){
    cin >> R[i];
  }
  vector<int> D(N);
  for (int i = 0; i < N; i++){
    cin >> D[i];
  }
  bool ok = true;
  for (int i = 0; i < N - 1; i++){
    if (D[i] != 0 && D[i + 1] == 0){
      ok = false;
    }
  }
  if (!ok){
    cout << 0 << endl;
  } else {
    int pos = 0;
    for (int i = 0; i < N; i++){
      if (D[i] == 0){
        pos = i + 1;
      } else {
        break;
      }
    }
    if (pos == N){
      cout << 1 << endl;
    } else {
      vector<long long> L2(N - pos);
      for (int i = pos; i < N; i++){
        L2[i - pos] = L[i];
      }
      vector<long long> R2(N - pos);
      for (int i = pos; i < N; i++){
        R2[i - pos] = R[i];
      }
      vector<int> D2(N - pos);
      for (int i = pos; i < N; i++){
        D2[i - pos] = D[i];
      }
      N -= pos;
      vector<int> D3(N, 0);
      D3[0] = D2[0] % 9;
      for (int i = 1; i < N; i++){
        D3[i] = (D2[i] - D2[i - 1] + 9) % 9;
      }
      long long ans = 1;
      for (int i = 0; i < N; i++){
        long long tmp = (modrepunit(R2[i]) - modrepunit(L2[i]) + MOD) % MOD;
        if (D3[i] == 0 && i != 0){
          tmp++;
          tmp %= MOD;
        }
        ans *= tmp;
        ans %= MOD;
      }
      cout << ans << endl;
    }
  }
}