import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
import numpy as np
MOD=10**9+9
def solve(m):
    n=len(m)
    dp=np.zeros((2, n+1, n*9+1), np.int64)
    for i in range(int(m[0])+1):
        if i==int(m[0]):
            dp[0][0][i]+=1
        else:
            dp[1][0][i]+=1
    for i in range(n-1):
        for k in range(10):
            if k<int(m[i+1]):
                dp[1][i+1][k:(i+1)*9+1+k]+=dp[0][i][:(i+1)*9+1]
            elif k==int(m[i+1]):
                dp[0][i+1][k:(i+1)*9+1+k]+=dp[0][i][:(i+1)*9+1]
            dp[1][i+1][k:(i+1)*9+1+k]+=dp[1][i][:(i+1)*9+1]
        dp[1][i+1]%=MOD
    return dp[0][n-1]+dp[1][n-1]
m, d=readline().decode().split()
a=solve(m)
b=solve(d)
n=min(len(m), len(d))
ans=(a[1:n*9+1]*b[1:n*9+1]%MOD).sum()%MOD
print(ans)