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.
def checkFace(a):
  a.sort()
  if a[0]=='a' and a[1]=='c' and a[2]=='e' and a[3]=='f':
    return True
  return False
n,m=[int(x) for x in input().split()]
lst=[]
for i in range(n):
  lst.append(input())
if min(n,m)==1:
  print(0)
else:
  res=0
  for i in range(0,n-1):
    for j in range(0,m-1):
      if checkFace([lst[i][j],lst[i][j+1],lst[i+1][j],lst[i+1][j+1]]):
        res+=1
  print(res)