The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for them. 

In this problem an image is a rectangular table that consists of lowercase Latin letters. A face on the image is a 2 × 2 square, such that from the four letters of this square you can make word "face". 

You need to write a program that determines the number of faces on the image. The squares that correspond to the faces can overlap.
The first line contains two space-separated integers, *n* and *m* (1 ≤ *n*, *m* ≤ 50) — the height and the width of the image, respectively.

Next *n* lines define the image. Each line contains *m* lowercase Latin letters.
l1 = [int(x) for x in input().split()]
rows = l1[0]
columns = l1[1]
l2 = []
for x in range(rows):
    l2.append(list(input()))
i=0
ans=0
#print(l2)
while i<rows-1:
    j=0
    while j<columns-1:
        targ = l2[i][j]+l2[i][j+1]+l2[i+1][j]+l2[i+1][j+1]
        if "f" in targ and "a" in targ and "c" in targ and "e" in targ:
            ans+=1   
        j+=1
    i+=1
print(ans)