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.
l,b=map(int,input().split())
t=[input() for i in range(l)]
'''for i in range(l):
    for j in range(b):
        t[i][j]=int(input())'''
count=0
if l<2 or b<2:
    print(0)
else:
    j=0
    i=0
    for i in range(l-1):
        for j in range(b-1):
            A=t[i][j]
            B=t[i][j+1]
            C=t[i+1][j]
            D=t[i+1][j+1]
            l=[A,B,C,D]
            if l.count('f')==1 and l.count('a')==1 and l.count('c')==1 and l.count('e')==1:
                count+=1
    print(count)








