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.
c=input()
a=eval(c[0])
b=eval(c[-1])
l=[]
for i in range(0,a):
    d=input()
    l.append(d)
d=0
for i in range(0,a-1):
    for j in range(0,b-1):
        if (l[i][j] in 'face'):
            if (l[i][j]!= l[i][j+1] != l[i+1][j]!= l[i+1][j+1] and l[i][j+1] in 'face' and l[i+1][j] in 'face' and l[i+1][j+1] in 'face'  ):
                d+=1

print(d)
