import std.algorithm, std.array, std.container, std.range, std.bitmanip;
import std.numeric, std.math, std.bigint, std.random, core.bitop;
import std.string, std.regex, std.conv, std.stdio, std.typecons;

const auto mod = 10 ^^ 9 + 9;

void main()
{
  auto rd = readln.split.map!(a => a.map!(c => c - '0').map!(to!int).array);
  auto m = rd[0], d = rd[1];

  auto maxK = max(m.length, d.length);

  auto mr = sum(m), dr = sum(d);

  auto r = 0;
  foreach (i; 0..min(mr.length, dr.length))
    r = (r + modMul(mr[i], dr[i], mod)) % mod;

  writeln(r);
}

int[] sum(int[] di) {
  auto r = new int[](di.length * 9 + 1);
  foreach (n; 1..di.length * 9 + 1)
    r[n] = calc(di, n.to!int);
  return r;
}

int calc(int[] di, int n)
{
  auto k = di.length.to!int;
  auto memo = new int[][][](k * 9 + 1, k + 1, 11);

  int dp(int[] di, int n, int f) {
    auto k = di.length;
    if (n < 0 || k * 9 < n) return 0;
    if (k == 1) return f < n ? 0 : 1;
    if (memo[n][k][f] > 0) return memo[n][k][f];

    auto r = 0;
    foreach (i; 0..f)
      r = (r + dp(di[1..$], n - i, 10)) % mod;
    if (f != 10)
      r = (r + dp(di[1..$], n - f, di[1])) % mod;
    memo[n][k][f] = r;
    return r;
  }

  return dp(di, n, di[0]);
}

int modMul(int a, int b, int mod)
{
  return ((a.to!long * b.to!long) % mod).to!int;
}