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.
a , b = map(int , input().split())
arr = ["x" * (b+2)]
r = lambda : list(map(int, input().split()))
c = 0

for i in range(a): arr.append('x' + input() + 'x')
arr.append("x"*(b+2))

# print(arr)


valid = list("acef")
for i in range(1,a+1):
    for j in range(1,b+1):
        ff = arr[i][j] + arr[i+1][j] + arr[i][j+1] + arr[i+1][j+1]
        if sorted(list(ff)) == valid:
            c +=1


print(c)
        