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.
#faces

numbers = [int(n) for n in input().split()]
a = numbers[0]
b = numbers[1]
text = []
face = "face"
tmp = ""
count = 0

text = [input() for i in range(a)]

for i in range(a-1):
    for j in range(b-1):
        if text[i][j] in face:
            tmp += text[i][j] + text[i+1][j] + text[i][j+1] + text[i+1][j+1]
            if "f" in tmp and "a" in tmp and "c" in tmp and "e" in tmp:
                count += 1
            tmp = ""

print(count)
