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.
tmp = input().split()
tmp[0] = int(tmp[0])
tmp[1] = int(tmp[1])
face = "acef"
my_str = []
for i in range(0,tmp[0]):
    my_str.append(input())

count = 0
for i in range(0,tmp[0]-1):
    for j in range(0,tmp[1]-1):
        my = ""
        my += my_str[i][j]
        my += my_str[i][j+1]
        my += my_str[i+1][j]
        my += my_str[i+1][j+1]

        my = list(my)
        my.sort()
        my = ''.join(my)
        if my == face:
            count += 1

print(count)