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.
firstLine = [int(n) for n in input().split()];

matrix = [];

for i in range(0, firstLine[0]):
    matrix.append(str(input()));
    
total = 0;
for i in range(0, len(matrix)-1):
    for j in range(0, len(matrix[0])-1):
        temp = "";
        temp += matrix[i][j];
        temp += matrix[i][j+1];
        temp += matrix[i+1][j];
        temp += matrix[i+1][j+1];
        if("f" in temp and "a" in temp and "c" in temp and "e" in temp):
            total += 1;

print(total);