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_detection(arr,n,m):
    if n == 1 or m == 1:
        return 0
    face = {'f','a','c','e'}
    faces=0
    for i in range(0,n-2):
        for j in range(0,m-2):
            square = set(arr[k][l] for l in range(j,j+2) for k in range(i,i+2))
            if square ==  face:
                faces+=1
    return faces

n,m = [int(x) for x in input().split()]
arr = []
for ii in range(n):
    arr.append(list(input()))
print(face_detection(arr,n,m))