from itertools import product

M,D = input().split()
mod = 10**9+9
def count(a):
    n = len(a)
    dp=[[[0] * 1801 for i in range(2)] for j in range(n+1)]
    dp[0][0][0] = 1

    for i, less, ketawa in product(range(n), (0,1), range(1801)):
        max_d = 9 if less else int(a[i])
        for d in range(max_d+1):
            less_ = less or d < max_d
            ketawa_ = ketawa + d
            if ketawa_<=1800:
                dp[i + 1][less_][ketawa_] += dp[i][less][ketawa]

    return dp[n]

ML = count(M)
DL = count(D)

ans = 0
for i in range(1,1801):
    ans += (ML[0][i]+ML[1][i])*(DL[0][i]+DL[1][i])

print(ans%mod)