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.
def tu():
    n, m = map(int, input().split())
    a = 'x'*(m+1)
    p = ['f','a','c','e']
    d = dict()
    ans=0
    for i in range(97, 123):
        d[chr(i)] = 0
    for i in range(n):
        s = input()+'x'
        for j in range(m):
            d[s[j]] = 1
            d[s[j+1]] = 1
            d[a[j]] = 1
            d[a[j+1]] = 1
            for j in p:
                if d[j] == 0:
                    break
            else:
                ans+=1
                #print(s)
            for j in p:
                d[j] = 0
        a = s
    print(ans)
tu()