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 math
import sys
from decimal import Decimal
inp=list(map(int,input().split()))
n=inp[0]
m=inp[1]
c=[]
for i in range(0,n):
    s=input()
    c.append([])
    for j in range(0,m):
        c[i].append(s[j])

ans=0

for i in range(0,n-1):
    for j in range(0,m-1):
        t=c[i][j]+c[i+1][j]+c[i+1][j+1]+c[i][j+1]
        if 'a' in t and 'f' in t and 'c' in t and 'e' in t:
            ans+=1
print(ans)
        
          
