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.
n, m = [int(i) for i in input().split()]
image = []
res = 0
for i in range(n):
    line = input()
    image.append(line)

lvl = 0
res_list = []
while lvl < n-1:
    pos1 = 0
    while pos1 < len(line)-1:
        str1 = image[lvl][pos1] + image[lvl][pos1+1]
        str2 = image[lvl+1][pos1] + image[lvl+1][pos1+1]
        str3 = str1 + str2
        scan = [i for i in str3]
        res_list.append(scan)
        pos1 += 1
    lvl += 1

for square in res_list:
    if 'f' in square:
        if 'a' in square:
            if 'c' in square:
                if 'e' in square:
                    res += 1

print(res)
