Write a program that counts how many times each digit from $0$ to $9$ appears when every integer from $A$ to $B$ (inclusive) is written down in order.
The input consists of several test cases. Each test case is a single line containing two integers $A$ and $B$ separated by a space. ($1 \le A \le B \le 10^8$)
The last line of the input contains two zeros; this line is not processed.
For each test case, print $10$ integers on one line, separated by spaces. The $i$-th integer is the number of times the digit $i-1$ appears when all numbers from $A$ to $B$ are written, printed in order from $0$ to $9$.