Seal_7 is a great painter, all of his painting are very famous worldwide. This time he is challenging himself to draw a unique kind of painting in which he can use at most 10 kinds of colour, each colour is denoted by a number from 0 to 9. To create this unique painting Seal_7 is provided with a number N.

Example, Let N=12 so the painting drawn by Seal_7 will be "123456789101112".

Since you are not as good of a painter as Seal_7, your only task is to find out the total quantity of each type colour required to paint this masterpiece.

Like for above example, you would have to print
1 5 2 1 1 1 1 1 1 1 

INPUT FORMAT

• The first line of input contain a integer T denoting the number of test cases

• Each of the next T lines contains an integer N.

OUTPUT FORMAT

• Each test case will contain 10 space seperated integer denoting the amount of colour of each of the 10 types of colours required to create the masterpeice.

PS : Seal_7 is not a good painter in real life

Constraint
1<=T<=100
1<=N<=10⁵