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.
__author__ = 'AndreyS'
inp=input()
x=int(inp[0])
y=int(inp[2])
faces=[]
isfaces=[]
count=0
idol=['f','a','c','e']
idol.sort()
for i in range (x):
    faces.append([])
    fuck=input()
    for j in range(y):

       faces[i].append(fuck[j])

def check(start,stop,start1,stop1):

    isfaces=[]

    for i in range (start,stop):
        for j in range (start1,stop1):

            isfaces.append(faces[i][j])
    isfaces.sort()
    if isfaces == idol:
        return 1
    else:
        return 0


for i in range(x-1):
    for j in range(y-1):

        if check(i,i+2,j,j+2) :
            count+=1
print(count)