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.
from itertools import permutations
def get_permutations(string):
    perms = permutations(string)
    perms = [''.join(perm) for perm in perms]
    return perms
a,b=map(int,input().split())
f='face'
ff= get_permutations(f)
s=[]
for i in range(a):
  s.append(input())
c=0
for i in range(a-1):
  for j in range(b-1):
    si=s[i][j]+s[i+1][j]+s[i][j+1]+s[i+1][j+1]
    if si in ff:c+=1
print(c)