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.
m, n = map(int, input().split(' '))
pic = []
count = 0
if m < 2 or n < 2:
    print(0)
    exit()
for i in range(m):
    pic.append(input())

for i in range(m-1):
    for j in range(n-1):
        #print(pic[i+1][j:j+2])
        s = pic[i][j:j+2] + pic[i+1][j:j+2]
        
        if 'f' in s and 'a' in s and 'c' in s and 'e' in s:
            count += 1
print(count)