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
Input=lambda:map(int,sys.stdin.readline().split())
res = 0
n, m = Input()
Pic = list()
for i in range(n):
    Pic.append(sys.stdin.read())
Face = 'acef'
for i in range(n):
    for j in range(m):
        if Pic[i][j] in Face:
            try:
                if ''.join(sorted(Pic[i][j]+Pic[i][j+1]+Pic[i+1][j]+Pic[i+1][j+1])) == Face:
                    res+=1
            except:
                pass
print(res)