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.
x = list(map(int, input().split(' ')))
n, m = x[0], x[1]
a = []
for i in range(n):
    a.append(input())

def check(x, y):
    mp = set()
    for i in range(x-1, x+1):
        for j in range(y-1, y+1):
             mp.add(a[i][j])
    return ('f' in mp) and ('a' in mp) and ('c' in mp) and ('e' in mp)

k = 0

for i in range(1, n):
    for j in range(1, m):
        if check(i, j):
            k += 1

print(k)

