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.
x=map(int,input().split())
n,m=x
c=0
t=[]
for i in range(n):
    a=input()
    t.append(a)
s={'f',"a","c","e"}
for i in range(n-1):
    for j in range(m-1):
        if t[i][j]=="f" or "c" or "c" or "e":
            s1=set(s)
            if t[i][j] in s1:
                s1.remove(t[i][j])
            if t[i+1][j] in s1:
                s1.remove(t[i+1][j])
            if t[i][j+1] in s1:
                s1.remove(t[i][j+1])
            if t[i+1][j+1] in s1:
                s1.remove(t[i+1][j+1])
            if len(s1)==0:
                c+=1



print(c)