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.
def findFace(i,j,img):
  letters = [img[i][j], img[i][j+1], img[i+1][j], img[i+1][j+1]]
  return set(letters) == set("face")

n, m = [int(k) for k in input().split()]
img = []
total = 0
for i in range(n):
  img.append(input())
for i in range(n):
  for j in range(m):
    if img[i][j] in "face" and i != n-1 and j != m-1:
      if findFace(i, j, img):
        total +=1
print(total)
	   	 	   	   		 	   		    			