Siri is participating in the China Collegiate Programming Contest (CCPC) online preliminary round.

After finishing the easy problem, she went to the restroom. When she returned, she found an extra character matrix on her editor.

This character matrix has $n$ rows, where each row has a length of $m$, and it consists only of lowercase letters.

She intends to choose two consecutive rows and two consecutive columns, such that the intersection of these two rows and two columns forms a $2 \times 2$ submatrix.

She wants to know how many such submatrices $A$ satisfy the condition $A = \begin{bmatrix} c & c \\ p & c \end{bmatrix}$.

Input

The first line contains two integers $n, m$ ($2 \leq n, m \leq 500$), representing the size of the matrix.

The next $n$ lines each contain a string of length $m$, representing the character matrix. The data is guaranteed to contain only lowercase letters.

Output

Output a single integer representing the answer.

Examples

Input 1

3 4
cccc
spcc
ccpc

Output 1

2