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