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__ = 'taras-sereda'

# input
# 4 4
# xxxx
# xfax
# xcex
# xxxx

n,m = input().split(' ')
n, m = int(n), int(m)
mat = [input() for i in range(n)]

# print(mat)
# print(n,m)
chars = ['f','a','c','e']
amount = 0
for i in range(n):
    for j in range(m):
        if mat[i][j] in chars:
            f = mat[i][j]
            kand = []
            kand.append(f)
            if mat[min(i+1,n-1)][j] in chars and mat[min(i+1,n-1)][j] not in kand:
                kand.append(mat[i+1][j])
                if mat[i][min(j+1,m-1)] in chars and mat[i][min(j+1,m-1)] not in kand:
                    kand.append(mat[i][j+1])
                    if mat[min(i+1,n-1)][min(j+1,m-1)] in chars and mat[min(i+1,n-1)][min(j+1,m-1)] not in kand:
                        kand.append(mat[i+1][j+1])
                        if set(kand) == set(chars):
                            amount += 1
print(amount)



