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())
table = []
for i in range(n):
    table.append(input())

ans = 0
for i in range(n - 1):
    for j in range(m - 1):
        di = [0, 0, 1, 1]
        dj = [0, 1, 0, 1]
        d = {}
        for k in range(4):
            c = table[i + di[k]][j + dj[k]]
            d[c] = d.get(c, 0) + 1
        flg = True
        for c in "face":
            if c not in d or d[c] != 1:
                flg = False
        if flg:
            ans += 1
print(ans)
