CF908G.New Year and Original Order

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

Let $S(n)$ denote the number that represents the digits of $n$ in sorted order. For example, $S(1)=1,S(5)=5,S(50394)=3459,S(353535)=333555$ .

Given a number $X$ , compute modulo $10^{9}+7$ .

The first line of input will contain the integer $X$ ( $1<=X<=10^{700}$ ).

Print a single integer, the answer to the question.

The first few values of $S$ are $1,2,3,4,5,6,7,8,9,1,11,12,13,14,15,16,17,18,19,2,12$ . The sum of these values is $195$ .