G. New Year and Original Ordertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet 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 109 + 7.InputThe first line of input will contain the integer X (1 ≤ X ≤ 10700).OutputPrint a single integer, the answer to the question.ExamplesInput21Output195Input345342Output390548434NoteThe 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. 
Input21
Output195
['dp', 'math', '*2800']