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.
def face(b,i,j):
            p=b[i][j]+b[i][j+1]+b[i+1][j]+b[i+1][j+1]
            if (p.find('f')+p.find('a')+p.find('c')+p.find('e'))==6:
                        return 1
            return 0
           
a=list(map(int,input().split()))
b=[]
r=0
for i in range(a[0]):
            b.append(input())
for i in range(a[0]-1):
            for j in range(a[1]-1):
                        r+=face(b,i,j)
print(r)
                        
               

            
