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.
y, x = map(int, input().split())
matrix = []
for i in range(y):
    string = list(map(str, input()))
    matrix.append(string)
count = 0
for i in range(y):
    for j in range(x):
        if(j<x-1 and i<y-1):
            miniMatrix = matrix[i][j] + matrix[i][j+1] + matrix[i+1][j] + matrix[i+1][j+1]
            if('f' in miniMatrix and 'a' in miniMatrix and 'c' in miniMatrix and 'e' in miniMatrix):
                count += 1
print(count)
		 	  		 			     	 	  				 	  	