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 calc(img):
    nr = len(img)
    nc = len(img[0])
    ret = 0
    for i in range(nr-1):
        for j in range(nc-1):
            tset = set()
            tset.add(img[i][j])
            tset.add(img[i][j+1])
            tset.add(img[i+1][j])
            tset.add(img[i+1][j+1])
            if 'f' in tset and 'a' in tset and 'c' in tset and 'e' in tset:
                ret += 1
    return ret  

def main():
    items = input().split()
    nr = int(items[0])
    nc = int(items[1])
    img = []
    for _ in range(nr):
        img.append(input())
    print(calc(img))

    
if __name__ == '__main__':
    main()
    