import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines

MOD=10**9+9
def solve(m):
    n=len(m)
    dp=[[[0]*(n*9+1) for i in range(n)] for j in range(2)]
    for i in range(10):
        if i==int(m[0]):
            dp[0][0][i]+=1
        elif i<int(m[0]):
            dp[1][0][i]+=1
    for i in range(n-1):
        for j in range((i+1)*9+1):
            for k in range(10):
                if k<int(m[i+1]):
                    dp[1][i+1][j+k]+=dp[0][i][j]
                    dp[1][i+1][j+k]%=MOD
                elif k==int(m[i+1]):
                    dp[0][i+1][j+k]+=dp[0][i][j]
                dp[1][i+1][j+k]+=dp[1][i][j]
                dp[1][i+1][j+k]%=MOD
    a=[x+y for i, (x, y) in enumerate(zip(dp[0][n-1], dp[1][n-1]))]
    return a
m, d=readline().decode().split()
a=solve(m)
b=solve(d)
ans=sum(x*y for i, (x, y) in enumerate(zip(a, b)) if i>0)%MOD
print(ans)