#include <iostream>
#include <string>
#include <cstring>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }



const long long MOD = 1000000009;

string st1, st2;
long long dp1[210][2100][3], dp2[210][2100][3];

int main() {
    while (cin >> st1 >> st2) {
        memset(dp1, 0, sizeof(dp1));
        memset(dp2, 0, sizeof(dp2));
        
        int n1 = st1.size();
        st1 += ' ';
        int n2 = st2.size();
        st2 += ' ';
        
        dp1[0][0][0] = 1;
        for (int i = 0; i <= n1; ++i) {
            for (int j = 0; j < 2000; ++j) {
                //if (dp1[i][j][0] || dp1[i][j][1]) cout << i << ", " << j << ": " << make_pair(dp1[i][j][0], dp1[i][j][1]) << endl;
                
                // from smaller
                for (int k = 0; k <= 9; ++k) {
                    (dp1[i+1][j+k][1] += dp1[i][j][1]) %= MOD;
                }
                
                // from exact
                for (int k = 0; k <= 9; ++k) {
                    if (k > st1[i]-'0') break;
                    if (k == st1[i] - '0') {
                        (dp1[i+1][j+k][0] += dp1[i][j][0]) %= MOD;
                    }
                    else {
                        (dp1[i+1][j+k][1] += dp1[i][j][0]) %= MOD;
                    }
                }
            }
        }
        
        dp2[0][0][0] = 1;
        for (int i = 0; i <= n2; ++i) {
            for (int j = 0; j < 2000; ++j) {
                
                // from smaller
                for (int k = 0; k <= 9; ++k) {
                    (dp2[i+1][j+k][1] += dp2[i][j][1]) %= MOD;
                }
                
                // from exact
                for (int k = 0; k <= 9; ++k) {
                    if (k > st2[i]-'0') break;
                    if (k == st2[i] - '0') {
                        (dp2[i+1][j+k][0] += dp2[i][j][0]) %= MOD;
                    }
                    else {
                        (dp2[i+1][j+k][1] += dp2[i][j][0]) %= MOD;
                    }
                }
            }
        }
            
        long long res = 0;
        for (int j = 1; j <= 2000; ++j) {
            res += (dp1[n1][j][0] + dp1[n1][j][1]) * (dp2[n2][j][0] + dp2[n2][j][1]);
            res %= MOD;
        }
        
        cout << res << endl;
    }
}