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 functools import reduce
M = {'f':2, 'a':4, 'c':8, 'e':16}
n, m = map(int, input().split())
A = []
for i in range(n):
    A.append(input())
cont = 0
B = [[0 for _ in range(m)] for _ in range(n)]
for i in range(n):
    for j in range(m):
        if A[i][j] in M.keys(): B[i][j] = M[A[i][j]]
#print(B)
for i in range(n-1):
    for j in range(m-1):
        cont += (30 == reduce(lambda x,y: x+y, B[i][j:j+2]+B[i+1][j:j+2]))
print(cont)
