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.
n,m=map(int,input().split())
alist=[]
for i in range(n):
    word=str(input())
    blist=[]
    for i in range(len(word)):
        blist.append(word[i])
    
    alist.append(blist)

count=0
if m==1 or n==1:
    print("0")
else:
    
    for i in range(1,n):
        for j in range(1,m):
            clist=[]
            clist.append(alist[i-1][j-1])
            clist.append(alist[i][j])
            clist.append(alist[i][j-1])
            clist.append(alist[i-1][j])
            
       
            if "f" in clist and "a" in clist and "c" in clist and "e" in clist:
                count=count+1
            else:
                continue
    print(count)