codeforces 549A Face Detection

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.

Input

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.

Output

In the single line print the number of faces on the image.

Example

Input

4 4
xxxx
xfax
xcex
xxxx

Output

1

Input

4 2
xx
cf
ae
xx

Output

1

Input

2 3
fac
cef

Output

2

Input

1 4
face

Output

0

Note

In the first sample the image contains a single face, located in a square with the upper left corner at the second line and the second column:

In the second sample the image also contains exactly one face, its upper left corner is at the second row and the first column.

In the third sample two faces are shown:

In the fourth sample the image has no faces on it.

题意：找一个2*2的正方形使其字母可以拼成face，可以重复覆盖。

思路：一看n，m的范围才50暴力直接过，然而我还是w了两遍，最近做题老是这样，明明可简单的题自己也会可是总是会在小细节处错误，不知道是啥原因，哎~，可能就是刷的题太少了吧。继续坚持吧。。。

代码：

#include <iostream>
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
char mp[1001][1001];
map<char,int>p;
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        //mem(mp,0);
        for(int i=0;i<n;i++)
        {
            getchar();
            for(int j=0;j<m;j++)
            {
                scanf("%c",&mp[i][j]);
            }
        }
        int k=0;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(mp[i][j]=='f'||mp[i][j]=='a'||mp[i][j]=='c'||mp[i][j]=='e')
                {
                    p[mp[i][j]]=1;p[mp[i][j-1]]=1;p[mp[i+1][j]]=1;p[mp[i+1][j-1]]=1;
                    if(p['f']==1&&p['a']==1&&p['c']==1&&p['e']==1)
                    {
                        k++;
                    }
                    p.clear();
                }
            }
        }
        printf("%d\n",k);
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                mp[i][j]=0;
            }
        }

    }
}