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.
A=[]
dx=[0,0,1,1]
dy=[0,1,0,1]
def fun(a,b):
    c={
        'f':1,'a':1,'c':1,'e':1
    }
    ans = 0
    for i in range(4):
        if A[a+dx[i]][b+dy[i]] in c:
            ans = ans + c[A[a+dx[i]][b+dy[i]]];
            c[A[a+dx[i]][b+dy[i]]]=0
    return ans == 4
n,m = [int(s) for s in input().split()]
for i in range(n):
    A.append(input())
ans = 0
for i in range(n-1):
    for j in range(m-1):
        if fun(i,j):
            ans+=1
print(ans)
 	  		    	 	  	    	   		  	