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())
face_li=[]
face_new = []
count = 0
for i in range(0,n):
    temp = ''.join(input().split())
    face_li.append(temp)

for i in range(0,n-1):
    for j in range(0,m-1):
        temp = face_li[i][j:j+2]
        temp1 = face_li[i+1][j:j+2]
        face_new.append(temp)
        face_new.append(temp1)
        face_new = ''.join(face_new)
        face_new = list(face_new)
        if "f" and "a" and "c" and "e" and not("x") in face_new:
              face_new.clear()
              count += 1
        else:
              face_new.clear()
print(count)
	 								 		    	    		  		