#include using namespace std; #define rep(i,a,b) for(int i=a;i= mod ? x - mod : x; } template int add(int x, T... y) { return add(x, add(y...)); } int mul(int x, int y) { return 1LL * x * y % mod; } template int mul(int x, T... y) { return mul(x, mul(y...)); } int sub(int x, int y) { return add(x, mod - y); } int modpow(int a, long long b) { int ret = 1; while (b > 0) { if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1; } return ret; } int modinv(int a) { return modpow(a, mod - 2); } int fac[201010], ifac[201010]; void initfac() { fac[0] = ifac[0] = 1; rep(i, 1, 201010) fac[i] = 1LL * i * fac[i - 1] % mod; rep(i, 1, 201010) ifac[i] = modinv(fac[i]); } int aCb(int a, int b) { if (b < 0 || a < b) return 0; return (1LL * fac[a] * ifac[a - b] % mod) * ifac[b] % mod; } //----------------------------------------------------------------------------------- int dp[10101][24][2][2]; int count(string S) { int n = S.length(); rep(i, 0, n + 1) rep(j, 0, 24) rep(k, 0, 2) rep(l, 0, 2) dp[i][j][k][l] = 0; dp[0][0][0][1] = 1; rep(i, 0, n) rep(j, 0, 24) rep(k, 0, 2) rep(l, 0, 2){ int cc = S[i] - '0'; int ma = 10; if (l == 1) ma = cc + 1; rep(c, 0, ma) { int ii = i + 1; int jj = (j * 10 + c) % 24; int kk = k | (c == 3); int ll; if (l == 1 && c == cc) ll = 1; else ll = 0; dp[ii][jj][kk][ll] = add(dp[ii][jj][kk][ll], dp[i][j][k][l]); } } int res = 0; rep(j, 0, 24) rep(l, 0, 2) if(j % 8 != 0){ res = add(res, dp[n][j][1][l]); } rep(j, 0, 24) rep(l, 0, 2) if (j % 3 == 0 && j % 8 != 0) { res = add(res, dp[n][j][0][l]); } return res; } //----------------------------------------------------------------------------------- bool chk(string S) { int mo = 0; for (char c : S) mo = (mo * 10 + c - '0') % 24; bool aho = (mo % 3 == 0); for (char c : S) if (c == '3') aho = true; bool seishun = (mo % 8 == 0); return aho && !seishun; } //----------------------------------------------------------------------------------- int main() { string A, B; cin >> A >> B; int ans = sub(count(B),count(A)); if (chk(A)) ans = add(ans, 1); cout << ans << endl; }