#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 using namespace std; using namespace atcoder; using ll = long long; using ld = long double; using pii = pair; using pll = pair; using vll = vector; using vvll = vector>; using vvvll = vector>>; using vii = vector; using vvii = vector>; using vvvii = vector>>; using vdd = vector; using vvdd = vector>; using vvvdd = vector>>; using vbb = vector; using vvbb = vector>; using vvvbb = vector>>; using vpll = vector; using vvpll = vector>; using vvvpll = vector>>; #define pb push_back #define mp make_pair #define sc second #define fr first #define endl '\n' #define stpr std::fixed << setprecision #define cYES cout << "YES" << endl #define cNO cout << "NO" << endl #define cYes cout << "Yes" << endl #define cNo cout << "No" << endl #define rep(i, n) for (ll i = 0; i < (n); ++i) #define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d) #define Rep(i, a, b) for (ll i = (a); i < (b); ++i) #define rrep(i, n) for (ll i = n - 1; i >= 0; i--) #define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d) #define rRep(i, a, b) for (ll i = a; i >= b; i--) #define crep(i) for (char i = 'a'; i <= 'z'; ++i) #define Crep(i) for (char i = 'A'; i <= 'Z'; ++i) #define ALL(x) (x).begin(), (x).end() #define rALL(x) (x).rbegin(), (x).rend() #define sort2(A, N) \ sort(A, A + N, \ [](const pii &a, const pii &b) { return a.second < b.second; }); #define debug(v) \ cout << #v << ":"; \ for (auto x : v) { \ cout << x << ' '; \ } \ cout << endl; int ctoi(const char c) { if ('0' <= c && c <= '9') return (c - '0'); return -1; } ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); } ll lcm(ll a, ll b) { return a * b / gcd(a, b); } ll rup(ll a, ll b) { return a + (b - a % b) % b; } ll rdc(ll a, ll b) { return a / b * b; } constexpr ll MOD = 1000000007; constexpr ll INF = 1000000011; constexpr ll MOD2 = 998244353; constexpr ll LINF = 1001002003004005006ll; constexpr ld EPS = 10e-10; template inline bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; } template inline bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; } template istream &operator>>(istream &is, vector &v) { for (auto &&x : v) is >> x; return is; } template istream &operator>>(istream &is, pair &p) { is >> p.first; is >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p) { os << p.first << ' ' << p.second; return os; } template ostream &operator<<(ostream &os, vector &v) { for (auto i = begin(v); i != end(v); ++i) { if (i != begin(v)) os << ' '; os << *i; } return os; } // 状態0 i文字目までSと一致 // 状態1 i文字目までにS以下が確定 int main() { string S; cin >> S; if (S.size() == 1) { int C = ctoi(S[0]); int ans = 0; rep(i, C + 1) { ans += i; } cout << ans << endl; return 0; } vvll dp(2, vll(S.size() + 1, 0)); dp[0][0] = 1; rep(i, S.size()) { ll C = ctoi(S[i]); dp[0][i + 1] = (dp[0][i] * C) % MOD; rep(j, 10) { dp[1][i + 1] = (dp[1][i + 1] + dp[1][i] * j) % MOD; } rep(j, C) { dp[1][i + 1] = (dp[1][i + 1] + dp[0][i] * j) % MOD; } if (i < S.size() - 1) { dp[1][i + 1] += 1; } } cout << (dp[1][S.size()] + dp[0][S.size()]) % MOD << endl; }