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 = map(int, input().split())

image = []
for _ in range(n):
    row = image.append(input())

f = {"f":1, "a":1, "c": 1, "e":1}
o = 0
for i, row in enumerate(image):
    for j, c in enumerate(row):
        d = set()

        try:
            cr = row[j+1]
            cb = image[i+1][j]
            crb = image[i+1][j+1]

            for ci in [c,cr,cb,crb]:
                if f.get(ci) is not None:
                    d.add(ci)

            if len(d) == 4:
                o +=1
        except IndexError:
            pass

        
print(o)