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.
import string

def main_funtion():
    photo = [list(input()) for i in range([int(i) for i in input().split(" ")][0])]
    counter = 0
    d = {}
    for i in range(len(photo)):
        for j in range(len(photo[i])):
            if (photo[i][j] != "f" or photo[i][j] != "a" or photo[i][j] != "c" or photo[i][j] != "e") and i < len(photo) - 1 and j < len(photo[i]) - 1 and set([photo[i][j], photo[i + 1][j], photo[i][j + 1], photo[i + 1][j + 1]]) == set(["f", "a", "c","e"]):
                counter += 1

    return counter





print(main_funtion())