#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


#define MOD 1000000007


int pow_mod(long long x,long long y){
	int res=1;
	while(y){
		if(y&1)res=(res*x)%MOD;
		y>>=1;
		x=(x*x)%MOD;
	}
	return res;
}


pair<int,int> dp[10000+2][2][24];

int calc(string &s,bool eq){
	memset(dp,0,sizeof(dp));
	dp[0][0][0].second=1;
	rep(i,s.size()){
		long long p=pow_mod(10,s.size()-i-1);
		rep(j,2)rep(k,24){
			pair<int,int> v=dp[i][j][k];
			rep(d,10){
				if(j==0&&s[i]-'0'<d)break;
				if(d==3){
					(dp[i+1][j||d<s[i]-'0'][(k+p*d)%24].first += (v.first+v.second)%MOD)%=MOD;
				}else{
					(dp[i+1][j||d<s[i]-'0'][(k+p*d)%24].first += v.first)%=MOD;
					(dp[i+1][j||d<s[i]-'0'][(k+p*d)%24].second += v.second)%=MOD;
				}
			}
		}
	}
	int ret=0;
	if(eq){
		rep(j,2){
			rep(k,24){
				if(k%8!=0)(ret+=dp[s.size()][j][k].first)%=MOD;
				if(k%8!=0)(ret+=dp[s.size()][j][k].second)%=MOD;
				
			}
		}
	}else{
		rep(k,24){
			if(k%8!=0)(ret+=dp[s.size()][1][k].first)%=MOD;
			if(k%3==0 && k%8!=0)(ret+=dp[s.size()][1][k].second)%=MOD;
		}
	}
	return ret;
}

int main(){
	string a,b;
	cin>>a>>b;
	cout<<(calc(b,true)-calc(a,false)+MOD)%MOD<<endl;
	return 0;
}