#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

string M,D;
#if DEBUG
#define SIZE 70
#define MAX 55
#else
#define SIZE 2222
#define MAX 2000
#endif
// i桁目までの、合計がjになる組み合わせ数
int DP[222][SIZE];
int N;
int MS[SIZE], DS[SIZE];
int MOD=1e9+9;

void solve() {
    cin>>M>>D;
    N = max(M.size(), D.size());
    reverse(ALL(M));
    reverse(ALL(D));
    int ML = M.size();
    int DL = D.size();
    
    REP(i,10) DP[0][i]=1;
    FOR(i,1,N+1) REP(j, MAX) REP(k,10){
        DP[i][j+k] += DP[i-1][j];
        DP[i][j+k] %= MOD;
    }
    int K;
    FOR(i,1,ML) REP(j,MAX){
        K = M[i]-'0';
        REP(k,K) {
            MS[j+k] += DP[i-1][j];
            MS[j+k] %= MOD;
        }
    }
    K = M[ML-1]-'0';
    FOR(k,1,K+1) MS[k] += 1;
    FOR(i,1,DL) REP(j,MAX){
        K = D[i]-'0';
        REP(k,K) {
            DS[j+k] += DP[i-1][j];
            DS[j+k] %= MOD;
        }
    }
    K = D[DL-1]-'0';
    FOR(k,1,K+1) DS[k] += 1;
    int ans = 0;
    FOR(i,1,MAX) {
        ans += MS[i] * DS[i];
        ans %= MOD;
    }
    cout << ans << endl;
}