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 = input().split()
n = int(n)
m = int(m)

matriz = [None] * n

for i in range(n):
	matriz[i] = input().split()
	for j in range(m):
		matriz[i][j] = str(matriz[i][j])

count = 0
for i in range(n):
	for j in range(m):
		try:
			string = matriz[i][j] + matriz[i + 1][j] + matriz[i][j + 1] + matriz[i + 1][j + 1]
			if 'f' in string and 'a' in string and 'c' in string and 'e' in string:
				count += 1
		except IndexError:
			pass	
print(count)