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()]

a = [input() for i in range(n)]

if n < 2 or m < 2:
    print(0)
else:
    faces = 0

    for row in range(n-1):
        for col in range(m-1):
            letters = a[row][col:col+2] + a[row+1][col:col+2]
            isF = False
            isA = False
            isC = False
            isE = False
            for letter in letters:
                if letter == 'f':
                    isF = True
                if letter == 'a':
                    isA = True
                if letter == 'c':
                    isC = True
                if letter == 'e':
                    isE = True
            if isF and isA and isC and isE:
                faces += 1

    print(faces)

