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.
n, m = map(int, input().split())
v = []
for _ in range(0, n):
    v.append("x" + input() + "x")
v = ['x' * (m + 2)] + v + ['x' * (m + 2)]
f = {'f', 'a', 'c', 'e'}
t = 0
for i in range(1, n + 1):
    for j in range(1, m + 1):
        if set([v[i][j], v[i + 1][j], v[i][j + 1], v[i + 1][j + 1]]) == f:
            t += 1
print(t)
