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.
__author__ = 'liraim'


def read():
    input_data = input().split()
    [height, width] = [int(input_data[0]), int(input_data[1])]
    data = []
    for i in range(height):
        data.append(input())
    return width, height, data

def solve(task_data):
    (width, height, input_data) = task_data
    count = 0
    for i in range(height - 1):
        for j in range(width - 1):
            line = input_data[i][j] + input_data[i + 1][j] + input_data[i][j + 1] + input_data[i + 1][j + 1]
            if 'f' in line and 'a' in line and 'c' in line and 'e' in line:
                count += 1
    return count

print(solve(read()))