#include <iostream>
#include <vector>
using namespace std;

using ll = long long;

const int MAX_DIGITS = 210;
const int MOD = 1e9 + 9;
int dp_m[MAX_DIGITS][2][MAX_DIGITS * 9];
int dp_d[MAX_DIGITS][2][MAX_DIGITS * 9];

int main() {
    string m, d;
    cin >> m >> d;

    vector<int> mv(m.size()), dv(d.size());
    for (int i = 0; i < m.size(); i++) mv[i] = m[i] - '0';
    for (int i = 0; i < d.size(); i++) dv[i] = d[i] - '0';

    dp_m[0][0][0] = 1;
    for (int i = 0; i < mv.size(); i++) {
        for (int less = 0; less <= 1; less++) {
            for (int sum = 0; sum <= i * 9; sum++) {
                for (int num = 0; num <= 9; num++) {
                    if (!less && num > mv[i]) break;
                    dp_m[i + 1][less || num < mv[i]][sum + num] += dp_m[i][less][sum];
                    dp_m[i + 1][less || num < mv[i]][sum + num] %= MOD;
                }
            }
        }
    }

    dp_d[0][0][0] = 1;
    for (int i = 0; i < dv.size(); i++) {
        for (int less = 0; less <= 1; less++) {
            for (int sum = 0; sum <= i * 9; sum++) {
                for (int num = 0; num <= 9; num++) {
                    if (!less && num > dv[i]) break;
                    dp_d[i + 1][less || num < dv[i]][sum + num] += dp_d[i][less][sum];
                    dp_d[i + 1][less || num < dv[i]][sum + num] %= MOD;
                }
            }
        }
    }

    int ans = 0;
    for (int sum = 1; sum <= min(mv.size(), dv.size()) * 9; sum++) {
        for (int less_m = 0; less_m <= 1; less_m++) {
            for (int less_d = 0; less_d <= 1; less_d++) {
                ans += ((ll)dp_m[mv.size()][less_m][sum] * (ll)dp_d[dv.size()][less_d][sum]) % MOD;
                ans %= MOD;
            }
        }
    }
    cout << ans << endl;

    return 0;
}