$mod=1000000009;

@0=(1);
for$n(1..200){
    for$i(0..$n*9){
        for$d(0..9){
            ($$n[$i+$d]+=${$n-1}[$i])%=$mod;
        }
    }
}

($M,$D)=<>=~/\d+/g;
{use bigint;++$M;++$D;}

$o=0;
$_=$M;
while($_){
  s/.//;
  $l=length;
  for$i(0..@$l){
    for$d(0..$&-1){
      ($M[$o+$i+$d]+=$$l[$i])%=$mod;
    }
  }
  $o+=$&;
}

$o=0;
$_=$D;
while($_){
  s/.//;
  $l=length;
  for$i(0..@$l){
    for$d(0..$&-1){
      ($D[$o+$i+$d]+=$$l[$i])%=$mod;
    }
  }
  $o+=$&;
}

for(1..2010){
  $r=($r+$D[$_]*$M[$_]%$mod)%$mod;
}
print$r;