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__ = 'Adam'

import sys

n, m = sys.stdin.readline().split(' ')
n, m = int(n), int(m)
data = []
for i in range(n):
    data.append(sys.stdin.readline()[:m])

#print(data)
#print(str(data[0])[0])
count = 0
for i in range(n-1):

    for j in range(m-1):
        #print(i, j)
        right = [data[i][j], data[i][j+1], data[i+1][j], data[i+1][j+1]]
        #print(right)
        if set(right) == set(['f', 'a', 'c', 'e']):
            count += 1
    #print('\n')

print(count)
