E

As a cute girl, Kotori likes playing ``Hide and Seek'' with cats particularly. 
Under the influence of Kotori, many girls and cats are playing ``Hide and Seek'' together. 
Koroti shots a photo. The size of this photo is n×mn×m, each pixel of the photo is a character of the lowercase(from `a' to `z'). 
Kotori wants to know how many girls and how many cats are there in the photo. 

We define a girl as -- we choose a point as the start, passing by 4 different connected points continuously, and the four characters are exactly ``girl'' in the order. 
We define two girls are different if there is at least a point of the two girls are different. 
We define a cat as -- we choose a point as the start, passing by 3 different connected points continuously, and the three characters are exactly ``cat'' in the order. 
We define two cats are different if there is at least a point of the two cats are different. 

Two points are regarded to be connected if and only if they share a common edge. 

Input

The first line is an integer TT which represents the case number. 

As for each case, the first line are two integers nn and mm, which are the height and the width of the photo. 
Then there are nn lines followed, and there are mm characters of each line, which are the the details of the photo. 

It is guaranteed that: 
TT is about 50. 
1≤n≤10001≤n≤1000. 
1≤m≤10001≤m≤1000. 
∑(n×m)≤2×106∑(n×m)≤2×106. 

Output

As for each case, you need to output a single line. 
There should be 2 integers in the line with a blank between them representing the number of girls and cats respectively. 

Please make sure that there is no extra blank. 

Sample Input

31 4girl2 3otocat3 4girlhrlthlca

Sample Output

1 00 2
4 1
题意：
找矩阵里有几个girl和cat，其中只要有一个点不一样的话这两个女孩(cat)就是不一样的。
思路：搜索dfs
代码：
#include <iostream>#include<stdio.h>#include<cstdio>#include<iostream>#include<algorithm>#include<math.h>#include<string.h>#include<map>#include<queue>#include<vector>#include<deque>#define ll long long#define inf 0x3f3f3f3f#define mem(a,b) memset(a,b,sizeof(a))using namespace std;int dir[4][2]= {{0,1},{1,0},{-1,0},{0,-1}};char a[2][10]= {"cat","girl"};char mp[1001][1001];int n,m;int sum,sum1;void dfs(int x,int y,int flag,int k)//用flag=1,0来判断是cat还是girl。{    if(flag==1)    {        if(k==3)        {            sum++;            return;        }    }    if(flag==0)    {        if(k==2)        {            sum1++;            return;        }    }    for(int i=0; i<4; i++)    {        int xx=x+dir[i][0];        int yy=y+dir[i][1];        if(mp[xx][yy]==a[flag][k+1]&&xx>=0&&xx<n&&yy>=0&&yy<m)//定义一个数组cat，girl每次和之后的一个字母一样就继续往后搜        {            dfs(xx,yy,flag,k+1);        }    }}int main(){    int t;    scanf("%d",&t);    while(t--)    {        scanf("%d%d",&n,&m);        //getchar();        sum=0;sum1=0;        for(int i=0; i<n; i++)        {            scanf("%s",mp[i]);        }        int x,y,x1,y1;        for(int i=0; i<n; i++)        {            for(int j=0; j<m; j++)            {                if(mp[i][j]=='g')                {                    dfs(i,j,1,0);                }                if(mp[i][j]=='c')                {                    dfs(i,j,0,0);                }            }        }        printf("%d %d\n",sum,sum1);    }}