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.
inp = list(map(int, input().split()))
im = []
for j in range(inp[0]):
    im.append(list(input()))
c = 0
i = 0
while i < inp[0]-1:
    j = 0
    while j < inp[1]-1:
        s = []
        s.append(im[i][j])
        s.append(im[i+1][j])
        s.append(im[i+1][j+1])
        s.append(im[i][j+1])
        s.sort()
        if s == sorted(['f', 'a', 'c', 'e']):
            c += 1
        j += 1
    i += 1
print(c)