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.
vars = ["face", "faec", "feac", "feca", "fcae", "fcea", "eafc", "eacf", "ecaf", "ecfa", "efac", "efca", "acfe", "acef",
        "aecf", "aefc", "afce", "afec", "cafe", "caef", "ceaf", "cefa", "cfea", "cfae"]


def define_faces(n, m, lst):
    count = 0
    for i in range(n):
        for j in range(m):
            if i + 1 < n and j + 1 < m and lst[i + 1][j + 1] + lst[i + 1][j] + lst[i][j + 1] + lst[i][j] in vars:
                count += 1
    return count


n1, m1 = [int(i) for i in input().split()]
b = list()
for z in range(n1):
    s = input()
    b.append(list(s))
print(define_faces(n1, m1, b))
