mod = 10 ** 9 + 9
U = 2020


def F(A):
    N = len(A)
    dp = [[[0] * 2 for _ in range(U + 1)] for _ in range(N + 1)]
    dp[0][0][0] = 1
    for i, nd in enumerate(A):
        nd = int(nd)
        for j in range(U):
            for k in range(2):
                for d in range(10):
                    ni = i + 1
                    nj = j + d
                    nk = k
                    if nj > U:
                        break
                    if nk == 0:
                        if d > nd:
                            continue
                        if d < nd:
                            nk = 1
                    dp[ni][nj][nk] += dp[i][j][k]
                    dp[ni][nj][nk] %= mod
    res = [(dp[N][i][0] + dp[N][i][1]) % mod for i in range(1, U)]
    return res


M, D = input().split()
M = F(M)
D = F(D)
ans = 0
for m, d in zip(M, D):
    ans += m * d
    ans %= mod
print(ans)