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(_list:[[str]], _row:int, _col:int) -> bool:
    s = ['f', 'a', 'c', 'e']
    try:
        s.remove(_list[_row][_col])
        s.remove(_list[_row][_col+1])
        s.remove(_list[_row+1][_col])
        s.remove(_list[_row+1][_col+1])
    except:
        pass

    if s == []:
        return True
    else:
        return False

row, col = map(int, input().split())
rec_table = []
for i in range(row):
    rec_table.append(list(input()))

ans = 0
for i in range(row-1):
    for j in range(col-1):
        if face(rec_table, i, j):
            ans += 1

print(ans)
