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 = (int(i) for i in input().split())
ref = set("face")
data = []
face = 0
for i in range(n):
    data.append(input())
for i in range(n):
    for j in range(m):
        if data[i][j] == "f":
            if i < n - 1 and j < m - 1:
                test = set(data[i][j]+data[i + 1][j]+data[i + 1][j + 1]+data[i][j + 1])
                if test == ref:
                    face += 1
            if i > 0 and j < m - 1:
                test = set(data[i][j]+data[i - 1][j]+data[i - 1][j + 1]+data[i][j + 1])
                if test == ref:
                    face += 1
            if i > 0 and j > 0:
                test = set(data[i][j]+data[i - 1][j]+data[i - 1][j - 1]+data[i][j - 1])
                if test == ref:
                    face += 1
            if i < n - 1 and j > 0:
                test = set(data[i][j]+data[i + 1][j]+data[i + 1][j - 1]+data[i][j - 1])
                if test == ref:
                    face += 1
print(face)
