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.
from itertools import permutations
x,y = map(int,input().split())
l = {"f","a","c","e"}
perm = permutations("face")
list1 = list(perm)
count = 0
arr = []
for i in range(x):
	t = input()
	arr.append(t)
for i in range(x-1):
	for j in range(y-1):
		t = (arr[i][j],arr[i+1][j],arr[i][j+1],arr[i+1][j+1])
		if t in list1:
			count = count + 1
print(count)