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.
a = []
b = []
n = 0
m = 0

def Init():
   global a,b,n,m
   size = [int(x) for x in input().split(" ")]
   n = size[0]
   m = size[1]
   
   for i in range(n):
      x = []
      y = input()
      for char in y:
        
        if (char == 'f') : x.append(1)
        elif (char == 'a') : x.append(5)
        elif (char == 'c') : x.append(9)
        elif (char == 'e'): x.append(13)
        else :x.append(0)
      a.append(x)
   
     
def Calcu(x, y):
  s=a[x][y] + a[x][y+1] + a[x + 1][y] + a[x + 1][y + 1]
  if (s) == 28:
    return True
  else:
    return False  
def getResuilt():
  global a, b, n, m
  res=0
  for i in range(n-1):
      for j in range(m - 1):
          if (Calcu(i,j)):
            res += 1
  print(res)
  


if __name__ == "__main__":
  Init()
  getResuilt()
