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())
if n == 1 or m == 1:
    print(0)
else:
    r = 0
    grid = []
    for _ in range(n):
        curr_line = list(input())
        grid.append(curr_line)
    for i in range(n - 1):
        for j in range(m - 1):
            curr_square = set()
            curr_square.add(grid[i][j])
            curr_square.add(grid[i][j+1])
            curr_square.add(grid[i+1][j])
            curr_square.add(grid[i+1][j+1])
            if curr_square == set(['f','a','c','e']):
                r += 1
    print(r)