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 f(c):
    if c == 'f':
        return 1
    elif c == 'a':
        return 10
    elif c == 'c':
        return 100
    elif c == 'e':
        return 1000
    return 0
n, m = [int(j) for j in input().split()]
mat = []
for j in range(n):
    mat.append(list(str(input())))
count = 0
for j in range(n - 1):
    for k in range(m - 1):
        c = f(mat[j][k]) + f(mat[j][k + 1]) + f(mat[j + 1][k]) + f(mat[j + 1][k + 1])
        if c == 1111:
            count += 1
print(count)
