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.
R, C = map(int,input().split())

AN  = 0
M=[]
for r in range(R):
    M +=[list(input())]
for r in range(R - 1):
    for c in range(C - 1):
        S = set()
        S.add(M[r][c])
        S.add(M[r+1][c])
        S.add(M[r][c+1])
        S.add(M[r+1][c+1])
        if S == {'f','a','c','e'}:
            AN += 1
print(AN)            
        
    