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.
string = input()
numbers = string.split()
a = int(numbers[0])
b = int(numbers[1])
rows = []
for x in range(a):
    row = input()
    rows.append(row)
faces = 0
for x in range(a - 1):
    for y in range(b - 1):
        p = rows[x]
        q = rows[x + 1]
        face = ["f", "a", "c", "e"]
        square = [p[y], p[y + 1], q[y], q[y + 1]]
        condition = True
        for z in face:
            if not z in square:
                condition = False
        if condition:
            faces += 1
print(faces)