## MDIGITS - Counting Digits

Đọc đề đẹp hơn ở:
https://codeforces.com/group/FLVn1Sc504/contest/274710/problem/R
https://codeforces.com/group/FLVn1Sc504/contest/274505/problem/X
 English Vietnamese
```Cho hai số nguyên a, b. Viết tất cả các số nằm giữa a, b; tính cả 2 số này.

Tính xem mỗi chữ số 0, 1, .., 9 mỗi số xuất hiện bao nhiêu lần.

Ví dụ, nếu a = 1024 và b = 1032, dãy sẽ là
1024 1025 1026 1027 1028 1029 1030 1031 1032
và có 10 số 0, 10 số 1, 7 số 2, ...
```

### Input

```Không quá 500 dòng. Mỗi dòng là hai số nguyên a,b với
0 < a, b < 100000000.
Kết thúc là hai số 0 0.

Sample Input
1 10
44 497
346 542
1199 1748
1496 1403
1004 503
1714 190
1317 854
1976 494
1001 1960
0 0```

### Output

```Với mỗi bộ test, in ra một dòng 10 số nguyên là số chữ số 0, 1, .. 9 tương ứng.

Sample output
1 2 1 1 1 1 1 1 1 1
85 185 185 185 190 96 96 96 95 93
40 40 40 93 136 82 40 40 40 40
115 666 215 215 214 205 205 154 105 106
16 113 19 20 114 20 20 19 19 16
107 105 100 101 101 197 200 200 200 200
413 1133 503 503 503 502 502 417 402 412
196 512 186 104 87 93 97 97 142 196
398 1375 398 398 405 499 499 495 488 471
294 1256 296 296 296 296 287 286 286 247
```

 Added by: ~!(*(@*!@^& Date: 2009-02-22 Time limit: 1s Source limit: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All except: ERL JS-RHINO NODEJS PERL6 VB.NET Resource: Shanghai 2004