#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 9;

ll dp1[205][2030][2]; // pos, sum, less
ll dp2[205][2030][2]; // pos, sum, less

void calc(ll dp[205][2030][2], string s) {
    dp[0][0][0] = 1;

    rep (i, s.length()) {
        rep (j, 2020) {
            rep (k, 2) {
                int ub;
                if (k) {
                    ub = 9;
                } else {
                    ub = s[i] - '0';
                }

                rep (l, ub + 1) {
                    (dp[i + 1][j + l][k || l < ub] += dp[i][j][k]) %= mod;
                }
            }
        }
    }
}

int main() {
    string M, D;
    cin >> M >> D;

    calc(dp1, M);
    calc(dp2, D);

    rep (j, 2020) {
        dp1[M.length()][j][0] += dp1[M.length()][j][1];
        dp2[D.length()][j][0] += dp2[D.length()][j][1];
    }

    ll ans = 0;

    rep2 (i, 1, 2020) {
        ans += dp1[M.length()][i][0] * dp2[D.length()][i][0];
        ans %= mod;
    }

    cout << ans << endl;
}