#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<int MOD>
class ModInt{
public:
    ModInt():value(0){}
    ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ }

    ModInt& operator+=(ModInt that){
        value = value+that.value;
        if(value>=MOD)value-=MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that){
        value -= that.value;
        if(value<0)value+=MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that){
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that){
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const{
        return ModInt(*this)+=that;
    }
    ModInt operator-(ModInt that) const{
        return ModInt(*this)-=that;
    }
    ModInt operator*(ModInt that) const{
        return ModInt(*this)*=that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const{
        if(value == 0)return 0;
        ModInt n = *this, res = 1;
        while(k){
            if(k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while(b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const{ return value; }

private:
    int value;
};
typedef ModInt<1000000009> mint;
ostream& operator<<(ostream& os, const mint& x){
    os << x.toi();
    return os;
}

const int R = 1801;
mint dp[202][R][2];

vector<mint> f(string &s){
    vector<mint> res(R);
    each(c, s)c -= '0';
    rep(i, sz(s) + 1)rep(j, R)rep(k, 2)dp[i][j][k] = 0;
    dp[0][0][0] = 1;
    rep(i, sz(s))rep(sm,R)rep(l,2)if(dp[i][sm][l].toi()){
        rep(d, 10){
            if(d > s[i] && !l)break;
            assert(sm + d < R);
            dp[i + 1][sm + d][l | (d < s[i])] += dp[i][sm][l];
        }
    }
    rep(i, R)rep(j, 2)res[i] += dp[sz(s)][i][j];
    return res;
}

int main(){
    string M, D;
    vector<mint> x, y;
    mint ans;
    cin >> M >> D;
    x = f(M);
    y = f(D);
    FOR(i,1,R)ans += x[i] * y[i];
    cout << ans << endl;
}