#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

typedef long long ll;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <iostream>
#include <queue>
#include <set>

using namespace std;

const int mod = 1000000009;

vector<ll> solve(string s){
  vector<int> a(s.size());
  REP(i,a.size()) a[i] = s[i] - '0';

  const int mx = 2000 + 10;
  vector<vector<ll> > ret(2, vector<ll>(mx));

  ret[1][0] = 1;

  REP(i,a.size()){
    vector<vector<ll> > next(2, vector<ll>(mx));
    for(int j = mx - 1; j >= 0; j--){
      if(ret[0][j]) REP(k,10) next[0][j + k] = (next[0][j + k] + ret[0][j]) % mod;
      if(ret[1][j]) REP(k,a[i]) next[0][j + k] = (next[0][j + k] + ret[1][j]) % mod;
      if(ret[1][j]) next[1][j + a[i]] = (next[1][j + a[i]] + ret[1][j]) % mod;
    }
    ret[0].swap(next[0]);
    ret[1].swap(next[1]);
  }

  vector<ll> ans(mx);
  REP(i,mx) ans[i] = (ret[0][i] + ret[1][i]) % mod;
  ans[0] = (ans[0] + mod - 1) % mod;
  return ans;
}

int main(){
  string m, d;
  cin >> m >> d;

  const vector<ll> mm = solve(m);
  const vector<ll> dd = solve(d);

  ll ans = 0;
  REP(i,mm.size()) ans = (ans + (mm[i] * dd[i]) % mod) % mod;

  printf("%lld\n", ans);

  return 0;
}