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.
ent = list(map(int,input().split()))[:2]
lin = ent[0]
col = ent[1]

mat = []
cont = 0
aux = []

for k in range (0, lin):
    ent = list(map(str,input().split()))[:col]
    mat.append(ent[0])

for i in range (0, lin - 1):
    for j in range (0, col - 1):
        aux.append(mat[i][j])
        aux.append(mat[i + 1][j])
        aux.append(mat[i][j + 1])
        aux.append(mat[i + 1][j + 1])
        if 'f' in aux and 'a' in aux:
            if 'c' in aux and 'e' in aux:
                cont += 1
        aux = []

print(cont)
 		 					      		 	 				 		 		