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__ = 'Rafael Capucho <[email protected]>'

def do_combination(mylist):
    result = []
    for i in range(len(mylist) - 1):
        result.append([mylist[i], mylist[i+1]])
    return result

def do_group(myinput, size, step=1):
    index = 0
    while index < len(myinput)-1:
        yield myinput[index:index+size]
        index += step

def do(combinations):
    count = 0
    for elem in combinations:
        group1 = list(do_group(elem[0], 2))
        group2 = list(do_group(elem[1], 2))
        letters = set()
        for i in range(len(group1)):
            letters.add(group1[i][0])
            letters.add(group1[i][1])
            letters.add(group2[i][0])
            letters.add(group2[i][1])
            if {'e','f','c','a'} == letters:
                count += 1
            letters = set()
    return count

the_input = []

height, _ = map(int, input().split())

for i in range(height):
    the_input.append(input())

print(do(do_combination(the_input)))
