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())
a = [ [0] * (m) for i in range(n) ]
for i in range(n):
    tmp = input()
    for j in range(len(tmp)):
        a[i][j] = tmp[j]
set_ = set()
s = 0
e = 0
for i in range(len(a)):
    for j in range(len(a[i])):
        if (a[i][j] == 'f'):
            s = 0
            for r in range(i,min(i+2,n)):
                for f in range(j,min(j+2,m)):
                    if ((a[r][f] == 'e') or (a[r][f] == 'c') or (a[r][f] == 'a')):
                        if (a[r][f] not in set_):
                            s = s + 1
                            set_.add(a[r][f])
            set_ = set()
            for r in range(max(0,i-1),min(i+1,n)):
                for f in range(max(0,j),min(j+2,m)):
                    if ((a[r][f] == 'e') or (a[r][f] == 'c') or (a[r][f] == 'a')):
                        if (a[r][f] not in set_):
                            s = s + 1
                            set_.add(a[r][f])
            set_ = set()
            for r in range(max(0,i-1),min(i+1,n)):
                for f in range(max(0,j-1),min(j+1,m)):
                    if ((a[r][f] == 'e') or (a[r][f] == 'c') or (a[r][f] == 'a')):
                        if (a[r][f] not in set_):
                            s = s + 1
                            set_.add(a[r][f])
            set_ = set()
            for r in range(i,min(i+2,n)):
                for f in range(max(0,j-1),min(j+1,m)):
                    if ((a[r][f] == 'e') or (a[r][f] == 'c') or (a[r][f] == 'a')):
                        if (a[r][f] not in set_):
                            s = s + 1
                            set_.add(a[r][f])
            set_ = set()
        if (s >= 4):
            e = e + 1
            s = 0
print(e)