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.
#include <iostream>
#include <string>
#include <vector>
#include<algorithm>
#include <bits/stdc++.h> 
#include <iomanip>

using namespace std;


int main()
{
	int n, m, i, j, count1 = 0;
	cin >> n >> m;
	string str1[n];
	string temp;
	for (i = 0; i < n; i++)
	{
		cin >> str1[i];
	}
	for (i = 0; i < n-1; i++)
	{
		for (j = 0; j < m-1; j++)
		{
		    temp = str1[i].substr(j, 2) + str1[i + 1].substr(j, 2);
			sort(temp.begin(), temp.end());
			if (temp == "acef")
			{
				count1 += 1;
			}
		}
	}
	cout << count1 << endl;
	return 0;
}