class mint:
    def __init__(self, x):
        self.__x = x % md

    def __str__(self):
        return str(self.__x)

    def __add__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x + other)

    def __sub__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x - other)

    def __rsub__(self, other):
        return mint(other - self.__x)

    def __mul__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x * other)

    __radd__ = __add__
    __rmul__ = __mul__

    def __truediv__(self, other):
        if isinstance(other, mint): other = other.__x
        return mint(self.__x * pow(other, md - 2, md))

    def __pow__(self, power, modulo=None):
        return mint(pow(self.__x, power, md))

md = 10 ** 9 + 9
def main():
    m, d = input().split()
    m = [int(c) for c in m]
    d = [int(c) for c in d]
    dpm = [[0 for _ in range(1801)] for _ in range(len(m) + 1)]
    dpd = [[0 for _ in range(1801)] for _ in range(len(d) + 1)]
    border = 0
    for i, a in enumerate(m):
        for s in range(1801):
            pre = dpm[i][s]
            if pre == 0: continue
            for na in range(10):
                dpm[i + 1][s + na] += pre
        for na in range(a):
            dpm[i + 1][border + na] += mint(1)
        border += a
    dpm[-1][border] += 1

    border = 0
    for i, a in enumerate(m):
        for s in range(1801):
            pre = dpd[i][s]
            if pre == 0: continue
            for na in range(10):
                dpd[i + 1][s + na] += pre
        for na in range(a):
            dpd[i + 1][border + na] += mint(1)
        border += a
    dpd[-1][border] += 1

    ans = sum(dpm[-1][i] * dpd[-1][i] for i in range(1, 1801))
    print(ans)

main()