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.
a, b = map(int, input().split())
cases = a
face = set("face")
matrix = []
while cases:
    cases -= 1
    s = list(input())
    matrix.append(s)
check = set()
ans = 0
for row in range(len(matrix)):
    for col in range(len(matrix[0])):
        if matrix[row][col] in face:
            if row < len(matrix)-1 and col < len(matrix[0])-1:
                check.add(matrix[row][col])
                check.add(matrix[row][col+1])
                check.add(matrix[row+1][col])
                check.add(matrix[row+1][col+1])
                if check == face:
                    ans += 1
                    check = set()

print(ans)
