M, D = map(int, input().split())
MOD = 1000000009

Msz = len(str(M))
Dsz = len(str(D))
MAX = max(Msz, Dsz)
last_max = sum(int(_) for _ in list(str(M)))

def dp(p):
    sz = len(str(p))
    dp = [[[0 for f in range(2)] for a in range(2005)] for b in range(205)]
    dp[0][0][0] = 1
    for i in range(sz):
        num = int(str(p)[-1-i])
        for j in range(2000):
            for l in range(2):
                if dp[i][j][l] == 0:
                    continue
                dp[i][j][l] %= MOD
                for k in range(10):
                    if k<num:
                        dp[i + 1][j + k][0] += dp[i][j][l]
                    elif k>num:
                        dp[i + 1][j + k][1] += dp[i][j][l]
                    else:
                        dp[i + 1][j + k][l] += dp[i][j][l]
    return dp

dp1 = dp(M)
dp2 = dp(D)
ans = 0
# for i in range(M_x):
#     for j in range(D_x):
#         for x in range(MAX*9):
#             ans += dp1[i][x][0] * dp2[j][x][0]
#             print(dp1[i][x][0] * dp2[j][x][0])

d1 = [0] * 2000
d2 = [0] * 2000
for i in range(MAX*9+2):
    d1[i] = dp1[Msz][i][0] % MOD
    d2[i] = dp2[Dsz][i][0] % MOD

for i in range(MAX*9+2):
    ans += d1[i] * d2[i]
    ans %= MOD

print(ans%MOD-1)
#
# M_set = [0]
# D_set = [0]
# for i in range(1, M+1):
#     M_set.append(sum_of_digit(i))
# for j in range(1, D+1):
#     D_set.append(sum_of_digit(j))
#
# M_set = set(M_set)
# D_set = set(D_set)
# ans = M_set & D_set
#
# print(len(ans) % 1000000009)
# print(M_set)