#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000LL

vector<int> Merge(vector<int> A,vector<int> B){
	vector<int> ret(9,0);
	for(int i=0;i<A.size();i++){
		for(int j=0;j<B.size();j++){
			int nxt = (i*10+j)%9;
			int D = mod(A[i]*B[j]);
			ret[nxt] = mod(ret[nxt] + D);
		}
	}
	return ret;
}

vector<int> Merge2(vector<int> A,vector<int> B){
	vector<int> ret(9,0);
	for(int i=0;i<A.size();i++){
		for(int j=0;j<B.size();j++){
			int nxt = (i+j)%9;
			int D = mod(A[i]*B[j]);
			ret[nxt] = mod(ret[nxt] + D);
		}
	}
	return ret;
}

vector<int> calc(long long X){
	vector<int> now = {2,1,1,1,1,1,1,1,1};
	vector<int> ret = {1,0,0,0,0,0,0,0,0};
	while(X!=0){
		if(X&1){
			ret = Merge(ret,now);
		}
		now = Merge(now,now);
		X/=2;
	}
	return ret;
}

vector<int> calc(long long L,long long R){
	vector<int> ret = calc(R);
	vector<int> t = calc(L);
	for(int i=0;i<ret.size();i++)ret[i] = mod(ret[i] - t[i]);
	ret[0] = mod(ret[0] + 1);
	return ret;
}

int main(){
	
	int N;
	cin>>N;
	deque<long long> L(N),R(N);
	deque<int> D(N);
	for(int i=0;i<N;i++)cin>>L[i];
	for(int i=0;i<N;i++)cin>>R[i];
	for(int i=0;i<N;i++)cin>>D[i];
	
	while(D.size()>0&&D.front()==0){
		D.pop_front();
		L.pop_front();
		R.pop_front();
	}
	
	if(D.size()==0){
		cout<<1<<endl;
		return 0;
	}
	N = D.size();
	bool zero = false;
	for(int i=0;i<N;i++){
		if(D[i]==0)zero=true;
	}
	if(zero){
		cout<<0<<endl;
		return 0;
	}

	vector<int> now = {1,0,0,0,0,0,0,0,0};
	for(int i=0;i<N;i++){
		auto x = calc(L[i],R[i]);
		now = Merge2(now,calc(L[i],R[i]));
		for(int j=0;j<9;j++){
			if(j!=D[i]%9)now[j] = 0;
		}
		if(D[i]==9&&i==0){
			now[0] = mod(now[0] - 1);
		}
	}
	
	int ans= 0;
	for(int i=0;i<now.size();i++)ans =mod(ans + now[i]);
	
	cout<<ans<<endl;
	
	return 0;
}