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.
n, m = map(int, input().split())
line = [input() for i in range(n)]
count = 0
if n<2 or m<2 :
  print(0)
else:
  for j in range(0,n-1):
    for i in range(0,m-1):
      sub1 = line[j][i:i+2]
      sub2 = line[j+1][i:i+2]
      if sub1 in ["ac","ca"]:
        if sub2 in ["fe","ef"]:
          count+=1
      elif sub1 in ["ae","ea"]:
        if sub2 in ["cf","fc"]:
          count+=1
      elif sub1 in ["af","fa"]:
        if sub2 in ["ec","ce"]:
          count+=1
      elif sub1 in ["ce","ec"]:
        if sub2 in ["af","fa"]:
          count+=1
      elif sub1 in ["cf","fc"]:
        if sub2 in ["ae","ea"]:
          count+=1
      elif sub1 in ["fe","ef"]:
        if sub2 in ["ac","ca"]:
          count+=1
  print(count)