The die is cast

A camera takes a picture of several thrown dice, and from that image alone we must count how many dots (pips) are showing on each die.

Each image contains only three kinds of pixels: background pixels, die pixels, and the dot pixels on a die. Two pixels are connected only when they share an edge; touching at just a corner does not count.

A set $S$ of pixels is connected if, for every pair of pixels $a$ and $b$ in $S$, there is a sequence $a_1, a_2, \dots, a_k$ of pixels in $S$ with $a = a_1$, $b = a_k$, and $a_i$ adjacent to $a_{i+1}$ for every $1 \le i < k$.

• A die is a maximal connected set of non-background pixels (both die pixels and dot pixels count as non-background). "Maximal" means you cannot add any other non-background pixel without breaking the connectivity.
• A dot is a maximal connected set of dot pixels.

For every die in the image, determine how many dots it contains.

The input contains several pictures. Each picture begins with a line holding two integers $w$ and $h$, the width and the height of the picture, with $5 \le w, h \le 50$.

The next $h$ lines contain exactly $w$ characters each:

• . for a background pixel,
• * for a die pixel,
• X for a dot pixel.

Dice may have different sizes and, because of optical distortion, need not be perfectly square. Every picture contains at least one die, and each die shows between $1$ and $6$ dots, inclusive.

The input ends with a picture whose first line is 0 0; that picture must not be processed.

Number the pictures $1, 2, 3, \dots$ in the order they appear.

For the $k$-th picture, print a line Throw k, then on the next line print the number of dots on each die in that picture, sorted in increasing order and separated by single spaces.

Separate the output of consecutive pictures with one blank line. There is no blank line after the last picture.