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.
import sys
import math


n,m = map(int, input().split())
b = []
for i in range(n):
    b.append(input())
f,a,c,e = False, False, False, False;
ans = 0;
for i in range(n - 1):
    for j in range(m -1):
        for o in range(i, i+ 2):
            for p in range(j, j+ 2):
                if b[o][p] == 'f':
                    f = True
                if b[o][p] == 'a':
                    a = True
                if b[o][p] == 'c':
                    c = True
                if b[o][p] == 'e':
                    e = True

        if f == c == a==e == True:
            ans+=1
        f, a, c, e = False, False, False, False;
print(ans)


