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 , m = map(int,input().split())
if n==1 or m == 1:
    print(0)
    exit()
arr = []
check =  set(["f","a","c","e"])
for i in range(n):
    arr.append(input())
cnt = 0
for i in range(n):
    for j in range(m):
        temp = set()
        temp.add(arr[i][j])
        if i + 1 < n:
            temp.add(arr[i+1][j])
        if j + 1 < m:
            temp.add(arr[i][j+1])
        if i + 1 < n and j + 1 < m:
            temp.add(arr[i+1][j+1])
        #print(temp,check,temp == check)
        if temp == check:
            cnt = cnt + 1
print(cnt)