M,D = input().split()
M=M[::-1]+"0"*202
D=D[::-1]+"0"*202
MOD = 10**9+9


def solve(LMT):
	global MOD
	#dp[dig][bool][s] := digでboolで和sな個数
	dp = [ [ [0]*1801 for _ in range(2) ] for _ in range(202) ]
	dp[0][1][0] = 1

	for dig in range(201):
		boundary = int(LMT[dig])
		for num in range(10):
			for s in range(1801-num):
				if num < boundary:
					dp[dig+1][True][s+num] += dp[dig][True][s] + dp[dig][False][s]
				elif num > boundary:
					dp[dig+1][False][s+num] += dp[dig][True][s] + dp[dig][False][s]
				else:
					dp[dig+1][True][s+num] += dp[dig][True][s]
					dp[dig+1][False][s+num] += dp[dig][False][s]
				dp[dig+1][True][s+num] %= MOD
				dp[dig+1][False][s+num] %= MOD

	return dp[-1][True]


DD = solve(D)
MD = solve(M)
ans = 0
for s in range(1,1801):
	ans += DD[s] * MD[s]
	ans %= MOD
print(ans)