Page not loading? Try clicking here.
Placeholder

#1430

Number of digits 1s 32MB

Problems

Given three natural numbers A, B, and C,
write a program that determines how many times each digit from 0 to 9 appears in the result of A × B × C.

For example, if A = 150, B = 266, and C = 427, then
A × B × C = 150 × 266 × 427 = 17,037,300,
and in the result 17037300,
the digit 0 appears 3 times, 1 appears 1 time, 3 appears 2 times, and 7 appears 2 times.


Input

In the first line, A is given;
in the second line, B is given;
and in the third line, C is given.

A, B, and C are all natural numbers greater than or equal to 100 and less than 1,000.


Output

On the first line, print how many times the digit 0 appears in the result of A × B × C.

Likewise, from the second line to the tenth line,
print, one per line in order, how many times each digit from 1 to 9 appears in the result of A × B × C.


Example

150 

266
427
3

1
0
2
0
0
0
2
0
0


Source

KOI 본선 2006 초2

You must sign in to write code.