#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const int MOD = 1000000009;

vector<int> solve(const string& s)
{
    int n = s.size();
    vector<vector<int> > dp(2, vector<int>(1, 0));
    dp[0][0] = 1;

    for(int i=0; i<n; ++i){
        vector<vector<int> > nextDp(2, vector<int>(dp[0].size() + 9, 0));
        for(int j=0; j<2; ++j){
            for(unsigned k=0; k<dp[j].size(); ++k){
                for(int a=0; a<=9; ++a){
                    if(j == 0 && a == s[i] - '0'){
                        nextDp[0][k+a] += dp[j][k];
                        nextDp[0][k+a] %= MOD;
                    }
                    else if(j == 1 || a < s[i] - '0'){
                        nextDp[1][k+a] += dp[j][k];
                        nextDp[1][k+a] %= MOD;
                    }
                }
            }
        }
        dp.swap(nextDp);
    }

    vector<int> ans(dp[0].size());
    for(unsigned i=0; i<dp[0].size(); ++i){
        ans[i] = dp[0][i] + dp[1][i];
        ans[i] %= MOD;
    }
    return ans;
}

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

    vector<int> a = solve(m);
    vector<int> b = solve(d);
    int n = min(a.size(), b.size());
    long long ans = 0;
    for(int i=1; i<n; ++i){
        ans += a[i] * (long long)b[i];
        ans %= MOD;
    }
    cout << ans << endl;

    return 0;
}