#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; string a,b; int m; ll memo[10010][24][2][2][2]; int po10[10010]; ll dp(int i,int r,int flagX,int flagY,int flagZ){ if (i==-1){ if (r==0 && flagX==0 && flagY==0 && flagZ==0) return 1; return 0; } if(memo[i][r][flagX][flagY][flagZ]!=-1) return memo[i][r][flagX][flagY][flagZ]; ll res=0; int p=a[i]-'0',q=b[i]-'0'; if (flagX==0 && flagY==0){ if (p==q) { if (p!=3) res+=dp(i-1,(r-p*po10[m-i-1]+24*24)%24,0,0,flagZ); else if (flagZ) res+=dp(i-1,(r-p*po10[m-i-1]+24*24)%24,0,0,0)+dp(i-1,(r-p*po10[m-i-1]+24*24)%24,0,0,1); } } if (flagX==1 && flagY==0){ if (q!=3) res+=dp(i-1,(r-q*po10[m-i-1]+24*24)%24,1,0,flagZ); else if (flagZ) res+=dp(i-1,(r-q*po10[m-i-1]+24*24)%24,1,0,0)+dp(i-1,(r-q*po10[m-i-1]+24*24)%24,1,0,1); if (p> a >> b; m=b.length(); rep(i,m+1){ rep(r,24){ rep(flagX,2){ rep(flagY,2){ rep(flagZ,2){ memo[i][r][flagX][flagY][flagZ]=-1; } } } } } po10[0]=1; rep(i,m){ po10[i+1]=po10[i]*10; po10[i+1]%=24; } if (a.length()>m) { cout << 0 << endl; return; } string s=""; rep(i,m-a.length()) s+="0"; a=s+a; //cout << a << endl; //cout << b << endl; ll ans=0; Rep(i,1,24){ if (i%8!=0) { rep(flagX,2){ rep(flagY,2){ ans+=dp(m-1,i,flagX,flagY,1); } } } if (i%3==0) { rep(flagX,2){ rep(flagY,2){ ans+=dp(m-1,i,flagX,flagY,0); } } } ans%=mod; } cout << ans << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }