MOD = 1000000009

m, d = input().split()

def digit_sum(S):
    n = len(S)
    dp = [0] * (9 * n + 1)
    s = int(S[0])
    eq = s
    for i in range(1, s):
        dp[i] = 1

    for ii, s in enumerate(S[1:], 1):
        s = int(s)
        ndp = [0] * (9 * n + 1)
        for i in range(10):
            for j in range(9 * ii + 1):
                ndp[i + j] += dp[j]
                ndp[i + j] %= MOD
        
        for i in range(1, 10):
            ndp[i] += 1

        for i in range(s):
            ndp[eq + i] += 1

        eq += s
        dp = ndp

    dp[eq] += 1
    return dp

A = digit_sum(m)
B = digit_sum(d)
ans = sum(a * b for a, b in zip(A, B)) % MOD
print(ans)