void main() { import std.stdio, std.string, std.conv, std.algorithm; auto args = readln.split.to!(string[]); const int MOD = 10 ^^ 9 + 7; int solve(string n) { auto memo = new int[][][][][](n.length + 1, 2, 2, 3, 8); foreach (a; 0 .. (n.length + 1)) { foreach (b; 0 .. 2) { foreach (c; 0 .. 2) { foreach (d; 0 .. 3) { foreach (e; 0 .. 8) { memo[a][b][c][d][e] = -1; } } } } } int f(size_t i, bool less, bool ok, int mod3, int mod8) { if (memo[i][less][ok][mod3][mod8] >= 0) { return memo[i][less][ok][mod3][mod8]; } if (i == n.length) { return (ok || mod3 == 0) && (mod8 > 0); } else { auto digit = less ? 9 : n[i] - '0'; int ret = 0; for (int d = 0; d <= digit; d++) { auto l = less || (d < digit); auto o = ok || (d == 3); auto m3 = (mod3 * 10 + d) % 3; auto m8 = (mod8 * 10 + d) % 8; (ret += f(i + 1, l, o, m3, m8)) %= MOD; } return memo[i][less][ok][mod3][mod8] = ret; } } return f(0, 0, 0, 0, 0); } bool yes(string n) { auto m8 = 0; foreach (ch; n) { (m8 *= 10) %= 8; m8 += ch - '0'; } if (m8 == 0) { return false; } else if (n.count('3') > 0) { writeln("3"); return true; } else { auto m3 = reduce!((res, ch) => (res + (ch - '0')) % 3)(0, n); return m3 == 0; } } auto res = (solve(args[1]) - solve(args[0]) + MOD) % MOD; writeln((res + yes(args[0])) % MOD); } void afill(Range, Type)(ref Range r, Type v) { static if (is(typeof(r) == Type[])) { foreach (ref e; r) { e = v; } } else { foreach (ref _r; r) { afill(_r, v); } } } void rd(T...)(ref T x) { import std.stdio : readln; import std.string : split; import std.conv : to; auto l = readln.split; assert(l.length == x.length); foreach (i, ref e; x) e = l[i].to!(typeof(e)); }