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.
import copy
n, m = (input().split(' '))
n = int(n)
m = int(m)
s = []
for i in range(n):
    s.append(input())
if n < 2 or m < 2:
    print(0)
else:
    count = 0
    a = ['f', 'a', 'c', 'e']
    for i in range(n-1):
        for j in range(m-1):
            b = copy.deepcopy(a)
            if s[i][j] in b:
                b.remove(s[i][j])
                if s[i+1][j] in b:
                    b.remove(s[i+1][j])
                    if s[i][j+1] in b:
                        b.remove(s[i][j+1])
                        if s[i+1][j+1] in b:
                            b.remove(s[i+1][j+1])
                            count +=1
    print(count)  