Problem Description

Given a matrix of size $n \times m$ consisting only of . and *.

The * in the matrix form several non-overlapping rectangles. They do not touch at edges or vertices.

Determine the number of rectangles.

Input Format

The first line contains two positive integers $n$ and $m$.

The following $n$ lines represent the matrix described in the problem. The matrix consists only of . and *.

Output Format

Output a single non-negative integer, which is your answer.

Sample Input and Output

Sample Input #1

6 7
***....
***..**
.....**
.***.**
.***...
.***...

Sample Output #1

3

Sample Input #2

3 3
*.*
...
*.*

Sample Output #2

4

Sample Input #3

1 10
.*.**.***.

Sample Output #3

3

Notes

Data Range

• For $10$ points, each rectangle in the matrix contains only one *.
• For another $15$ points, it is guaranteed that $n = 1$.
• For all data, $1 \leq n, m \leq 100$.

Notes

The problem is translated from COCI2019-2020 CONTEST #5 T1 Emacs, translated by 90693.

见题面 Input 部分

见题面 Output 部分