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.
l=input().split(" ")
h=int(l[0])
w=int(l[1])
lst=[]
for i in range (h):
 lst.append(input())
c=0
for i in range(h-1):
 for j in range(w-1):
  s=lst[i][j:j+2]+lst[i+1][j:j+2] 
  if 'f' in s and 'a' in s and 'c' in s and 'e' in s:
   c+=1
print(c)
		  				  		       	     	  		