eolymp
bolt
Try our new interface for solving problems
Problems

SumThem All

SumThem All

Find the sum of all the digits in all the integers between lowerBound and upperBound inclusive.

Input

Each line contains two integers lowerBound and upperBound (0lowerBoundupperBound2 * 109).

Output

For each test case print in a separate line the sum of all the digits in all the integers between lowerBound and upperBound inclusive.

Time limit 1 second
Memory limit 128 MiB
Input example #1
0 3
14 53
24660 308357171
Output example #1
6
296
11379854844