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.
if __name__ == "__main__":
    n,m = [int(x) for x in input().strip().split()]
    image = [input() for i in range(n)]

    res = 0
    for i in range(n-1):
        for j in range(m-1):
            s = image[i][j] + image[i][j+1] + image[i+1][j] + image[i+1][j+1]
            #print("".join(sorted(s)))
            if "".join(sorted(s)) == "acef":
                res += 1
    print(res)
