#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { std::cin >> t; } templatevoid Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define PAIR std::pair #define IN(a, x, b) (a<=x && x(end-start).count();std::cerr<<"[Time:"< tmp(a);std::cout << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";} //#define int ll using ll = long long; constexpr int INFINT = 1 << 30; constexpr ll INFLL = 1LL << 60; constexpr double EPS = 0.0000000001; constexpr int MOD = 1000000009; // dp[桁数][未満フラグ][和] ll dpM[205][2][2000]; ll dpD[205][2][2000]; // cnt[和] ll cntM[2000]; ll cntD[2000]; int main() { INIT; VAR(std::string, m, d); // m int mSize = m.size(); dpM[0][0][0] = 1; REP(i, mSize) REP(j, 2) REP(k, 2000) { int lim = j ? 9 : m[i] - '0'; REP(num, lim + 1) { ll& now = dpM[i + 1][j | num < lim][k + num]; now += dpM[i][j][k]; now %= MOD; } } REP(j, 2) REP(k, 2000) { cntM[k] += dpM[mSize][j][k]; cntM[k] %= MOD; } // d int dSize = d.size(); dpD[0][0][0] = 1; REP(i, dSize) REP(j, 2) REP(k, 2000) { int lim = j ? 9 : d[i] - '0'; REP(num, lim + 1) { ll& now = dpD[i + 1][j | num < lim][k + num]; now += dpD[i][j][k]; now %= MOD; } } REP(j, 2) REP(k, 2000) { cntD[k] += dpD[mSize][j][k]; cntD[k] %= MOD; } // ans ll ans = 0; REP(i, 2000) { ans += cntM[i] * cntD[i]; ans %= MOD; } OUT(--ans)BR; return 0; }