문제1249--How many 0

### 1249: How many 0

실행시간 제한: 10 Sec  메모리사용 제한: 128 MB
제출: 22  통과: 15
[제출] [채점기록] [묻고답하기]

#### 문제 설명

A Benedict monk No. 16 writes down the decimal representations of all natural numbers between and including

m and n , m n

. How many 0's will he write down?

Input consists of a sequence of lines. Each line contains two unsigned 32-bit integers m and n, mn. The last line of input has the value of m negative and this line should not be processed.

For each line of input print one line of output with one integer number giving the number of 0's written down by the monk.

#### 입력 예시 Copy

10 11
100 200
0 500
1234567890 2345678901
0 4294967295
-1 -1


#### 출력 예시 Copy

1
22
92
987654304
3825876150