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())

image = list()
for i in range(n):
    image.append(list(input()))

c = 0
for i in range(n):
    for j in range(m):
        if image[i][j] != 'x':
            if i + 1 < n and image[i + 1][j] != 'x':
                if j + 1 < m and image[i][j + 1] != 'x':
                    if image[i + 1][j + 1] != 'x':
                        se = set()
                        se.add(image[i][j])
                        se.add(image[i + 1][j])
                        se.add(image[i][j + 1])
                        se.add(image[i + 1][j + 1])
                        if len(se) == 4:
                            c += 1
print(c)