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] = [int(i) for i in input().split()]

matrix = []

for i in range(n):
    linha = input()
    matrix.append(linha)

num = 0

for i in range(n - 1):
    for j in range(m - 1):
        letters = ['f', 'a', 'c', 'e']
        falhou = False
        for k in range(2):
            for l in range(2):
                elem = matrix[i + k][j + l]
                if elem in letters:
                    letters.remove(elem)
                else:
                    falhou = True
                    break
            if falhou:
                break
        if not falhou:
            num += 1

print(num)
			  	 	     		  	  	   			 		