local mfl, mce = math.floor, math.ceil
local mod = 1000000009
local function badd(x, y) return (x + y) % mod end

local function bmul(x, y)
  local x1, y1 = mfl(x / 31623), mfl(y / 31623)
  local x0, y0 = x - x1 * 31623, y - y1 * 31623
  return (x1 * y1 * 14120 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod
end

local m, d = io.read():match("(%d+) (%d+)")
local lim = 2000
local function solve(x)
  local dp1, dp2 = {}, {}
  for i = 1, lim do
    dp1[i] = 0
  end
  local maxsum = 0
  for i = 1, #x do
    local src = i % 2 == 1 and dp1 or dp2
    local dst = i % 2 == 1 and dp2 or dp1
    for j = 1, lim do
      dst[j] = 0
    end
    local b = x:byte(i) - 48
    local spos = 1 < i and 0 or 1
    for j = spos, b - 1 do
      dst[j + maxsum] = badd(dst[j + maxsum], 1)
    end
    for j = 0, 9 do
      for k = lim - j, 1, -1 do
        dst[k + j] = badd(dst[k + j], src[k])
      end
    end
    if 1 < i then
      for j = 1, 9 do
        dst[j] = badd(dst[j] , 1)
      end
    end
    maxsum = maxsum + b
  end
  local tbl = #x % 2 == 1 and dp2 or dp1
  tbl[maxsum] = badd(tbl[maxsum], 1)
  local tmp = {}
  for i = 1, lim do
    tmp[i] = tbl[i]
  end
  return tmp
end
local a = solve(m)
local b = solve(d)
local ret = 0
for i = 1, lim do
  ret = badd(ret, bmul(a[i], b[i]))
end
print(ret)