#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

const ll mod=1000000007;
//    digit nz ls  3  mod 24
ll dp[10010][2][2][2][24];

ll calc(string &number){
	clr(dp,0);
	dp[0][0][0][0][0]=1LL;
	int n=number.size();
	rep(i,n)rep(nz,2)rep(ls,2)rep(th,2)rep(cmod,24){
		rep(d,10){
			int cur=number[i]-'0';
			int nnz=nz; if(nnz==0&&d!=0) nnz=1;
			int nls=ls; if(nls==0&&d<cur) nls=1;
			if(nls==0&&d>cur) break;
			int nth=th; if(nth==0&&d==3) nth=1;
			int nmod=(10*cmod+d)%24;
			dp[i+1][nnz][nls][nth][nmod]+=dp[i][nz][ls][th][cmod];
			dp[i+1][nnz][nls][nth][nmod]%=mod;
		}
	}
	ll ret=0LL;
	rep(i,2){
		for(int j=0;j<24;j+=3)
			if(j%8) ret=(ret+dp[n][1][i][0][j])%mod;
		for(int j=0;j<24;j++)
			if(j%8) ret=(ret+dp[n][1][i][1][j])%mod;
	}
	return ret;
}

int main(void){
	string A,B;
	cin >> A >> B;
	ll ans=calc(B)-calc(A);
	int cmod=0,th=0;
	rep(i,A.size()){
		if(A[i]=='3') th=1;
		cmod=(10*cmod+A[i]-'0')%24;
	}
	if((cmod%3==0||th)&&cmod%8!=0) ans++;
	while(ans<0) ans+=mod;
	cout << ans << endl;
	return 0;
}