#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vector<int> a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 2015, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

// Mod int
const int mod = 1000000009;
struct mint{
	ll x;
	mint():x(0){}
	mint(ll x):x((x%mod+mod)%mod){}
	mint operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
	mint operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	mint operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
	mint operator+(const mint& a)const{ return mint(*this) += a;}
	mint operator-(const mint& a)const{ return mint(*this) -= a;}
	mint operator*(const mint& a)const{ return mint(*this) *= a;}
  bool operator==(const mint& a)const{ return x == a.x;}
};
typedef vector<mint> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
//

struct dat {
  vvvi dp;
  dat(string s) {
    dp = vvvi(205,vvi(2,vi(2035)));
    int n = sz(s);
    dp[0][0][0] = 1;
    rep(i,n) {
      rep(j,MX) {
        rep(k,10) {
          dp[i+1][1][j+k] += dp[i][1][j];
        }
        rep(k,10) {
          if (s[i]-'0' > k) {
            dp[i+1][1][j+k] += dp[i][0][j];
          } else if (s[i]-'0' == k) {
            dp[i+1][0][j+k] += dp[i][0][j];
          }
        }
      }
    }
    rep(i,MX) dp[0][0][i] = dp[n][0][i]+dp[n][1][i];
  }
};

int main(){
  string s, t;
  cin >> s >> t;
  dat a(s), b(t);
  mint ans = 0;
  rrep(i,MX-1) ans += a.dp[0][0][i]*b.dp[0][0][i];
  cout << ans.x << endl;
  return 0;
}