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.
arr = list(map(int, input().rstrip().split()))
arra= []
if arr[0]==1 or arr[1]==0 :
    print("0")
else:
    for i in range(arr[0]):
        b = input()
        a = list(b)
        # print(a)

        arra.append(a)
    count = 0
    # print(arra)
    # print(arra[0][0])
    x = arr[0]-1
    y = arr[1]-1
    z = x*y
    for i in range(x):

        # print("loop number :",i+1)
        for j in range(y):
            ar = []
            # print(arra[i][j])
            ar.append(arra[i][j])
            # print(arra[i][j+1])
            ar.append(arra[i][j + 1])
            # print(arra[i+1][j])
            ar.append( arra[i + 1][j])
            # print(arra[i+1][j+1])
            ar.append( arra[i + 1][j + 1])

            if 'f' in ar and 'a' in ar and 'c' in ar and 'e' in ar:
                count+=1
                # print(j)
    print(count)
