#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

const LLI mod = 1000000009;

LLI dp1[300][3000][2];
LLI dp2[300][3000][2];


int main(){
  string M,D;
  while(cin >> M >> D){

    fill_array(dp1, 0);
    fill_array(dp2, 0);

    dp1[0][0][0] = 1;

    REP(i,(int)M.size()){
      REPE(j,2000){
        REP(k,2){
          REP(x,10){
            if(k or M[i]-'0' >= x){
              (dp1[i+1][j+x][k or M[i]-'0' > x] += dp1[i][j][k]) %= mod;
            }
          }
        }
      }
    }

    dp2[0][0][0] = 1;

    REP(i,(int)D.size()){
      REPE(j,2000){
        REP(k,2){
          REP(x,10){
            if(k or D[i]-'0' >= x){
              (dp2[i+1][j+x][k or D[i]-'0' > x] += dp2[i][j][k]) %= mod;
            }
          }
        }
      }
    }

    LLI ans = 0;

    REPE(i,2000){
      REP(j,2){
        REP(k,2){
          (ans += dp1[M.size()][i][j] * dp2[D.size()][i][k] % mod) %= mod;          
        }
      }
    }

    (ans += (mod-1)) %= mod; // 0/0 を除く
    
    cout << ans << endl;
  }



  return 0;
}