def solve(M, D):
    mod = 10**9 + 9
    if M > D:
        M, D = D, M
    dp = preprocess(D, mod)
    dpM = calc(M, dp, mod)
    dpD = calc(D, dp, mod)
    n = 0
    for m, d in zip(dpM, dpD):
        n += m * d
        n %= mod
    return n


def preprocess(D, mod):
    n = len(str(D))
    dp = []
    dp_prev = [0] * (n * 9 + 1)
    dp_prev[0] = 1
    dp.append(dp_prev)
    for i in range(1, n):
        dpi = dp_prev[:]
        for j in range(1, 10):
            for k in range(0, 9 * (i - 1) + 1):
                dpi[j+k] += dp_prev[k]
        for j in range(0, 9 * i + 1):
            dpi[j] %= mod
        dp.append(dpi)
        dp_prev = dpi
    return dp


def calc(D, dp, mod):
    ds = [int(d) for d in str(D)]
    n = len(ds)
    dpD = [0] * (n * 9 + 1)
    cumd = 0
    for i, di in enumerate(ds, 1):
        dpi = dp[n - i]
        for j in range(di):
            for k in range(9*(n - i) + 1):
                dpD[cumd + j + k] += dpi[k]
        cumd += di
    dpD[cumd] += 1
    dpD[0] = 0
    return dpD


if __name__ == '__main__':
    M, D = map(int, input().split())
    print(solve(M, D))