from itertools import product
mod = 10**9+9
m, d = input().split()

def rec(n:str):
    keta = len(n)
    dp = [[[0]*(9*keta+10) for i in range(2)] for j in range(keta+1)]
    dp[0][1][0] = 1
    for i, j, k in product(range(keta), range(2), range(9*keta+1)):
        top = int(n[i]) if j else 9
        for l in range(top+1):
            dp[i+1][j and l == top][k+l] += dp[i][j][k]
            dp[i+1][j and l == top][k+l] %= mod
    return dp

dp_m = rec(m)
dp_d = rec(d)
ans = 0
first = True
for i, j, k, l in zip(dp_m[-1][0],dp_m[-1][1], dp_d[-1][0],dp_d[-1][1]):
    if first:
        first=False
        continue
    ans += (i+j)*(k+l)
    ans %= mod
print(ans)