import sys

# sys.setrecursionlimit(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

def dodp(aa, eq):
    dp = [[0]*24, [0]*24]
    s = t = 0
    for i, a in enumerate(aa):
        ndp = [[0]*24, [0]*24]
        for f in range(2):
            for j in range(24):
                pre = dp[f][j]
                if pre == 0: continue
                for d in range(10):
                    nf = f | (d == 3)
                    nj = (j*10+d)%24
                    ndp[nf][nj] += pre
                    ndp[nf][nj] %= md
        for d in range(i == 0, a):
            nf = t | (d == 3)
            nj = (s*10+d)%24
            ndp[nf][nj] += 1
        if i:
            for d in range(1, 10):
                ndp[d == 3][d] += 1
        if a == 3: t = 1
        s = (s*10+a)%24
        dp = ndp

    res = 0
    for j in range(3, 24, 3):
        res += dp[0][j]
        res %= md
    for j in range(24):
        if j%8 == 0: continue
        res += dp[1][j]
        res %= md
    if eq and s%8 and (t or s%3 == 0): res += 1
    return res

aa,bb = SI().split()
aa=list(map(int,aa))
bb=list(map(int,bb))

ans = dodp(bb, 1)-dodp(aa, 0)
print(ans%md)