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):
      a.append(input())
def Process():
    global a, b, n, m
    
    for i in range(n):
      x=[]
      for j in range(m - 1):
            if (a[i][j] != 'x' and a[i][j + 1] != 'x'):
                x.append(1)
            else:
                x.append(0)
      b.append(x)
  
def getResuilt():
  global a, b, n, m
  res=0
  for i in range(n-1):
      for j in range(m - 1):
          if (b[i][j] == 1 and b[i + 1][j] == 1):
            res += 1
  print(res)
  


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