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 main():

    rows, cols = map(int, input().split())
    arr = []

    cont = 0
    for i in range(rows):
        arr.append([c for c in input()])

    for i in range(0, rows-1):
        for j in range(0, cols-1):
            isFace = True

            word = []
            word.append(arr[i][j])
            word.append(arr[i][j+1])
            word.append(arr[i+1][j])
            word.append(arr[i+1][j+1])

            for k in ['f', 'a', 'c', 'e']:
                if k not in word:
                    isFace = False

            if isFace:
                cont += 1
    print(cont)

main()
 	 				    	  		 	  		 		  		 	