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.
r, c = map(int,input().split())
l = [[c for c in input()] for _ in range(r)]
total = 0
f = set(c for c in 'face')
for x in range(r-1):
	for y in range(c-1):
		if l[x][y] in 'face':
			total += {l[x][y],l[x][y+1],l[x+1][y],l[x+1][y+1]} == f
print (total)
