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.


y = int(input())
x = int(input())


tab = []
for x in range(1, y):
    tab.append(list(map(int, input().split())))


nb = 0
for i in range(y - 1):
    for j in range(x - 1):
        f = 0
        a = 0
        c = 0
        e = 0
        for k in range(2):
            for l in range(2):
                if(tab[i + k][j + l] == 'f'):
                    f += 1
                if(tab[i + k][j + l] == 'a'):
                    a += 1
                if(tab[i + k][j + l] == 'c'):
                    c += 1
                if(tab[i + k][j + l] == 'e'):
                    e += 1

        if((f == 1) and (a == 1) and (c == 1) and (e == 1)):
            nb += 1


print(nb)
