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.
def fa(a):
    s = ["f","a","c","e"]
    p = 0
    for i in range(len(a)):
        if s.count(a[i]):
            s.remove(a[i])
            p+=1
    if p==4:
        return 1
    return 0
s = []
k = input().split(" ")
n,m = int(k[0]),int(k[1])
for i in range(n):
    s+=[list(input())]
h = 0
for i in range(n-1):
    for l in range(m-1):
        h += fa(s[i][l:l+2]+s[i+1][l:l+2])
print(h)
