# include "bits/stdc++.h" using namespace std; using LL = long long; using ULL = unsigned long long; const double PI = acos(-1); templateconstexpr T INF() { return ::std::numeric_limits::max(); } templateconstexpr T HINF() { return INF() / 2; } template T_char TL(T_char cX) { return tolower(cX); }; template T_char TU(T_char cX) { return toupper(cX); }; typedef pair pii; const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 }; const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; } int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; } int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; } LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); }; LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; }; # define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end() # define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end()) # define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL) # define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU) # define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++) # define REP(i,upupu) FOR(i,0,upupu) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) string m, d; const int mod = 1e9+9; LL dpm[222][2][3333], dpd[222][2][3333]; int main(){ INIT; cin >> m >> d; dpm[0][0][0] = 1; REP(i, (int)m.size()){ REP(j, 2){ REP(k, 2222){ int x = j ? 9 : m[i] - '0'; REP(d, x + 1){ dpm[i + 1][j || d < x][k + d] += dpm[i][j][k]; dpm[i + 1][j || d < x][k + d] %= mod; } } } } dpd[0][0][0] = 1; REP(i, (int)d.size()){ REP(j, 2){ REP(k, 2222){ int x = j ? 9 : d[i] - '0'; REP(d, x + 1){ dpd[i + 1][j || d < x][k + d] += dpd[i][j][k]; dpd[i + 1][j || d < x][k + d] %= mod; } } } } LL ans = 0; REP(i, 3333){ ans += (dpm[(int)m.size()][0][i] + dpm[(int)m.size()][1][i])*(dpd[(int)d.size()][0][i] + dpd[(int)d.size()][1][i]); ans %= mod; } cout << (ans - 1 + mod)%mod << endl; }