You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Background

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

Input

输入第一行为 n,m 表示为n*m 的矩阵。 接下来n行为矩阵内容。 1 <= m <= 100 and 1 <= n <= 100.

Output

给你一个一维的矩阵，由‘*’和‘@’组成，问图中有多少个‘@’符号的联通块（上，下，左，右，左上，左下，右上，右下都可联通）输出连通块的块数即可。 注意：原题为多组输入，这里改为单组输入。

Samples

1 1
*

3 5
*@*@*
**@**
*@*@*

1 8
@@****@*

5 5 
****@
*@@*@
*@**@
@@@*@
@@**@

0

1

2

2

Limitation

1s, 1024KiB for each test case.