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.
n = input()
vals = n.split()
vals = [int(i) for i in vals]

vars = []
for i in range(vals[0]):
    vars.append(input())

aux = []
cont = 0
for i in range(vals[0]-1):
    for j in range(vals[1]-1):
        aux.append(vars[i][j])
        aux.append(vars[i][j+1])
        aux.append(vars[i+1][j])
        aux.append(vars[i+1][j+1])
        if 'f' in aux and 'a' in aux and 'c' in aux and 'e' in aux:
            cont+=1
        aux = []

print(cont)
    
		     	  	     		 	   	 	 			