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(" "))
a=[]
for x in range(n):
    a.append(list(list(input())))
p=['f','a','c','e']
p.sort()
count=0
for x in range(n):
    for y in range(m):
        for x1 in range(x+2,n+1):
            for y2 in range(y+2,m+1):
                t=[]
                for cc in range(x,x1):
                    for bb in range(y,y2):
                        t.append(a[cc][bb])
                t.sort()
                if t==p:
                    count=count+1
print(count)