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 = map(int, input().split())
s, count, a = '', 0, 'face'
p1, p2, p3, p4 = 0, 1, m, m+1
for _ in range(n):
	s += input()

if n<2 or m<2:
	print(count)
else:
	while 1:
		x = ''
		x += s[p1]+s[p2]+s[p3]+s[p4]
		if sorted(x)==sorted(a):
			count+=1
		if p4 == n*m-1:
			break
		if p2 == m-1:
			p1+=2; p2+=2; p3+=2; p4+=2
		else:
			p1+=1; p2+=1; p3+=1; p4+=1
	print(count)