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.
import sys



input       = []
input_index = 0

def next(type, number = None):
	def next():
		global input, input_index
		
		
		while input_index == len(input):
			if sys.stdin:
				input       = sys.stdin.readline().split()
				input_index = 0
			else:
				raise Exception()
				
				
		input_index += 1
		
		return input[input_index - 1]
		
		
	if number is None:
		result = type(next())
	else:
		result = [type(next()) for _ in range(number)]
		
	return result
	
	
	
n, m = next(int, 2)
iis = [next(str) for _ in range(n)]


count = 0

for i in range(n - 1):
	for j in range(m - 1):
		s = {iis[i][j], iis[i+1][j], iis[i][j+1], iis[i+1][j+1]}
		
		if "f" in s and "a" in s and "c" in s and "e" in s:
			count += 1
			
			
print(count)
