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.
h, w = map(int, input().split())
ans = 0
image = [input() for _ in range(h)]
face = set('face')
for j in range(h - 1):
    for i in range(w - 1):
        if image[j][i] in face:
            s = {image[j + dj][i + di] for dj in (0, 1) for di in (0, 1)}
            if s == face:
                ans += 1
print(ans)
