#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, int> P;
typedef pair<pair<int, int>, int> PP;
const ll INF = 1LL << 60;
const ll MOD = 1000000009;

//------------------------------------------------------------------------------------------------------------------------------

ll dpM[210][2][2100];
ll dpD[210][2][2100];
int main(void) { 
    string M, D;
    cin >> M >> D;
    dpM[0][0][0] = dpD[0][0][0] = 1;
    int szm = M.size(), szd = D.size();
    for (int i = 0; i < szm; i++) {
        int num = M[i] - '0';
        for (int j = 0; j < 2; j++) {
            for(int sum = 0; sum < 2000; sum++) {
                for (int d = 0; d <= (j ? 9 : num); d++) {
                    dpM[i + 1][j || (d < num)][sum + d] += dpM[i][j][sum];
                    dpM[i + 1][j || (d < num)][sum + d] %= MOD;
                }
            }
        }
    }
    for (int i = 0; i < szd; i++) {
        int num = D[i] - '0';
        for (int j = 0; j < 2; j++) {
            for(int sum = 0; sum < 2000; sum++) {
                for (int d = 0; d <= (j ? 9 : num); d++) {
                    dpD[i + 1][j || (d < num)][sum + d] += dpD[i][j][sum];
                    dpD[i + 1][j || (d < num)][sum + d] %= MOD;
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < 2; i++) {
        for(int j = 0; j < 2; j++) {
            for(int sum = 1; sum < 2000; sum++) {
                ans += dpM[szm][i][sum] * dpD[szd][j][sum];
                ans %= MOD;
            }
        }
    }
    cout << ans << endl;
}