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=list(map(int,input().split()))
Seq=[list(input())for I in range(N)]
Ans=0
for I in range(N-1):
    for J in range(M-1):
        Det=['f','a','c','e']
        Used=[]
        if Seq[I][J]in Det:
            Used.append(Seq[I][J])
            if Seq[I+1][J]in Det and not Seq[I+1][J]in Used:
                Used.append(Seq[I+1][J])
                if Seq[I][J+1]in Det and not Seq[I][J+1]in Used:
                    Used.append(Seq[I][J+1])
                    if Seq[I+1][J+1]in Det and not Seq[I+1][J+1]in Used:
                        '''
                        Seq[I][J]='#'
                        Seq[I+1][J]='#'
                        Seq[I+1][J+1]='#'
                        Seq[I][J+1]='#'
                        '''
                        Ans+=1
print(Ans)
