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,b=map(int,input().split())
l=[]
p=0
for m in range (a):
    lPrime=list(input())
    l.append(lPrime)
for q in range (0,a-1):
    for w in range (0,b-1):
        if l[q][w]=="f":
            l[q][w]=1
        if l[q][w+1]=="f":
            l[q][w+1]=1
        if l[q+1][w]=="f":
            l[q+1][w]=1
        if l[q+1][w+1]=="f":
            l[q+1][w+1]=1
        if l[q][w]=="a":
            l[q][w]=100
        if l[q][w+1]=="a":
            l[q][w+1]=100
        if l[q+1][w]=="a":
            l[q+1][w]=100
        if l[q+1][w+1]=="a":
            l[q+1][w+1]=100
        if l[q][w]=="c":
            l[q][w]=101
        if l[q][w+1]=="c":
            l[q][w+1]=101
        if l[q+1][w]=="c":
            l[q+1][w]=101
        if l[q+1][w+1]=="c":
            l[q+1][w+1]=101
        if l[q][w]=="e":
            l[q][w]=5
        if l[q][w+1]=="e":
            l[q][w+1]=5
        if l[q+1][w]=="e":
            l[q+1][w]=5
        if l[q+1][w+1]=="e":
            l[q+1][w+1]=5
        if l[q][w]=="x":
            l[q][w]=0
        if l[q][w+1]=="x":
            l[q][w+1]=0
        if l[q+1][w]=="x":
            l[q+1][w]=0
        if l[q+1][w+1]=="x":
            l[q+1][w+1]=0
for i in range(0,a-1):
    for j in range(0,b-1):
        u=(l[i][j])+(l[i][j+1])+(l[i+1][j])+(l[i+1][j+1])
        if u==207:
            p=p+1
print(p)
