#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; #define rep2(i, m, n) for (int i = (m); i < (n); ++i) #define rep(i, n) rep2(i, 0, n) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) typedef modint1000000007 mint; typedef long long ll; mint solve(string x, bool mode){ int size = x.size(); vector<mint> dpy(24); vector<mint> dpn(24); bool nowisy = false; int now24 = 0; for (int num=0; num<size; num++){ vector<mint> ndpy(24); vector<mint> ndpn(24); //継続 for (int i=0; i<10; i++){ if (i==3){ for (int j=0; j<24; j++){ ndpy[(i+10*j)%24] += dpy[j] + dpn[j]; } }else{ for (int j=0; j<24; j++){ ndpy[(i+10*j)%24] += dpy[j]; ndpn[(i+10*j)%24] += dpn[j]; } } } //新規 if (num > 0){ for (int i=1; i<10; i++){ if (i==3) ndpy[i] += 1; else ndpn[i] += 1; } } int targ = x[num] - '0'; //解放 if (nowisy){ for (int i=(num<1); i<targ; i++){ ndpy[(i+10*now24)%24] += 1; } }else{ for (int i=(num<1); i<targ; i++){ if (i==3) ndpy[(i+10*now24)%24] += 1; else ndpn[(i+10*now24)%24] += 1; } } for (int i=0; i<24; i++){ dpn[i] = ndpn[i]; dpy[i] = ndpy[i]; } if (targ == 3) nowisy = true; now24 = (10*now24+targ) % 24; } if (mode){ if (nowisy) dpy[now24] += 1; else dpn[now24] += 1; } mint ans = 0; for (int i=0; i<24; i++){ if (i%8 != 0){ ans += dpy[i]; if (i%3 == 0) ans += dpn[i]; } } return ans; } int main(){ string a, b; cin >> a >> b; mint ans = solve(b,true) - solve(a,false); cout << ans.val() << endl; }