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.
a = [int(j) for j in input().split()]
w = []
for k in range(a[0]):
    w.append(input())
if a[0] == 1 or a[1] == 1:
    b = 0
else:
    b = 0
    for k in range(a[0]-1):
        for j in  range(a[1]-1):
            s = w[k][j:j+2] + w[k+1][j:j+2]
            if 'a' in s and 'f' in s and 'c' in s and 'e' in s:
                b += 1
print(b)