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 isface(lst):
    face = set('face')
    for i in range(4):
        if lst[i] in face:
            face.remove(lst[i])
        else:
            return False
    return True


n, m = map(int, input().split())
arr = list([input() for i in range(n)])

faces = 0
if not n == 1 and not m == 1:
    for i in range(n-1):
        for j in range(m-1):
            if isface((arr[i][j], arr[i+1][j], arr[i][j+1], arr[i+1][j+1])):
                faces += 1

print(faces)
