#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))
const int MOD = int(1e9+9);

ll dp1[2000][222][2], dp2[2000][222][2];
string M,D;

ll dfs( ll (*dp)[222][2], const string &v, const int s, const int i, const bool f){
    if(s < 0) return 0;
    if(i == v.size()) return (s == 0)?1:0;
    if(dp[s][i][f] >= 0) return dp[s][i][f];
    int d = v[i]-'0';
    ll res = 0;
    if(f) REP(j,d+1) (res += dfs(dp, v, s-j, i+1, j==d)) %= MOD;
    else  REP(j,10) (res += dfs(dp, v, s-j, i+1, 0)) %= MOD;
    return (dp[s][i][f] = res);
}

int main(){
    do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0);
    memset(dp1,-1,sizeof(dp1));
    memset(dp2,-1,sizeof(dp2));
    cin >> M >> D;
    ll res = 0;
    FOR(i,1,2000) (res += dfs(dp1, M, i, 0, 1) * dfs(dp2, D, i, 0, 1) % MOD) %= MOD;
    cout << res << endl;
    return 0;
}