G11_4 - DIGITS COUNT

no tags 

Diana is going to write a list of all positive integers between A and B, inclusive, in base 10 and without any leading zeros. She wants to know how many times each digit is going to be used.

Input

Each test case is given in a single line that contains two integers A and B (1 ≤ A ≤ B ≤ 108).

The last test case is followed by a line containing two zeros.

Output

For each test case output a single line with 10 integers representing the number of times each digit is used when writing all integers between A and B, inclusive, in base 10 and without leading zeros. Write the counter for each digit in increasing order from 0 to 9.

Example

Input:
1 9
12 321
5987 6123
12345678 12345679
0 0

Output
0 1 1 1 1 1 1 1 1 1
61 169 163 83 61 61 61 61 61 61
134 58 28 24 23 36 147 24 27 47
0 2 2 2 2 2 2 2 1 1

hide comments
cosmolusive: 2019-09-15 08:53:14

is this problem solvable?
I try to print one number per test case , all answer in 0s , using brute force , implemented algorithm all got runtime error (SIGXFSZ)


Added by:MaratónAFDM
Date:2017-11-15
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C C++ 4.3.2 JAVA