Skewers

Sejong is threading ingredients onto skewers to roast over a campfire during a camping trip. His mother asked him to put one meat, one scallion, and one mushroom on each skewer so the family eats a balanced mix. Sejong dislikes mushrooms, so he wants skewers with only meat and scallion. He plans to thread one meat and one scallion, then pretend to add a mushroom at the end and roast the skewer without actually adding one.

The ingredients are laid out in an $N\times M$ grid. Each cell holds meat, scallion, or mushroom. To make a skewer, choose three cells in a row, column, or diagonal that are consecutive, and thread the ingredients in that order. The mushroom must be at an end of the skewer, because it is only a pretend addition. A meat or scallion cell cannot go onto more than one skewer, but one mushroom can be used for several skewers.

The first line contains two integers $N$ and $M$, separated by a space. $(1\le N,M\le 100)$

From the second line onward, $N$ lines each contain a string of length $M$. The $j$-th character of the $i$-th string is the ingredient in row $i$, column $j$. Each string consists only of S, G, and M, which stand for meat, scallion, and mushroom.

Print the maximum number of mushroom-free skewers Sejong can make.