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.
r, c = map(int, input().split())
mat = []
sum = 0
res = 0
for _ in range(r): mat.append(input())
for i in range(r-1):
    for j in range(c-1):
        w1, w2, w3, w4 = mat[i][j], mat[i][j+1], mat[i+1][j+1], mat[i+1][j]
        if 'f' in {w1,w2,w3,w4}: sum+=1
        if 'a' in {w1,w2,w3,w4}: sum+=1
        if 'c' in {w1,w2,w3,w4}: sum+=1
        if 'e' in {w1,w2,w3,w4}: sum+=1
        if sum == 4: res+=1
        sum = 0
print(res)
 	  			    			 	 	 	 	 	  	 	 	