1393_D. Rarity and New Dress
Carousel Boutique is busy again! Rarity has decided to visit the pony ball and she surely needs a new dress, because going out in the same dress several times is a sign of bad manners. First of all, she needs a dress pattern, which she is going to cut out from the rectangular piece of the multicolored fabric.

The piece of the multicolored fabric consists of n × m separate square scraps. Since Rarity likes dresses in style, a dress pattern must only include scraps sharing the same color. A dress pattern must be the square, and since Rarity is fond of rhombuses, the sides of a pattern must form a 45^{\circ} angle with sides of a piece of fabric (that way it will be resembling the traditional picture of a rhombus).

Examples of proper dress patterns: <image> Examples of improper dress patterns: <image> The first one consists of multi-colored scraps, the second one goes beyond the bounds of the piece of fabric, the third one is not a square with sides forming a 45^{\circ} angle with sides of the piece of fabric.

Rarity wonders how many ways to cut out a dress pattern that satisfies all the conditions that do exist. Please help her and satisfy her curiosity so she can continue working on her new masterpiece!

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 2000). Each of the next n lines contains m characters: lowercase English letters, the j-th of which corresponds to scrap in the current line and in the j-th column. Scraps having the same letter share the same color, scraps having different letters have different colors.

Output

Print a single integer: the number of ways to cut out a dress pattern to satisfy all of Rarity's conditions.

Examples

Input


3 3
aaa
aaa
aaa


Output


10


Input


3 4
abab
baba
abab


Output


12


Input


5 5
zbacg
baaac
aaaaa
eaaad
weadd


Output


31

Note

In the first example, all the dress patterns of size 1 and one of size 2 are satisfactory.

In the second example, only the dress patterns of size 1 are satisfactory.
```python
r,c=map(int,input().split())
rama=[]
for i in range(r):
    rama.append(list((input())))
visit=[[1 for i in range(c)] for j in range(r)]

for i in range(2,r):
    for j in range(1,c-1):
        if(rama[i][j]==rama[i-1][j-1]==rama[i-1][j+1]==rama[i-2][j]==rama[i-1][j]):
            visit[i][j]=min(visit[i-1][j-1],visit[i-1][j+1],visit[i-2][j],visit[i-1][j])+1
add=0
for i in visit:
    for j in i:
        add+=j
print(add)
```