Problem Link : http://www.lightoj.com/volume_showproblem.php?problem=1238

/*
         +-+ +-+ +-+
         |R| |.| |S|
         +-+ +-+ +-+
 */

#include <bits/stdc++.h>

#define pii             pair <int,int>
#define sc              scanf
#define pf              printf
#define Pi              2*acos(0.0)
#define ms(a,b)         memset(a, b, sizeof(a))
#define pb(a)           push_back(a)
#define MP              make_pair
#define db              double
#define ll              long long
#define EPS             10E-10
#define ff              first
#define ss              second
#define sqr(x)          (x)*(x)
#define D(x)            cout<<#x " = "<<(x)<<endl
#define VI              vector <int>
#define DBG             pf("Hi\n")
#define MOD             100007
#define MAX             10000
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a)           (int)a.size()
#define sf(a)           scanf("%d",&a)
#define sff(a,b)        scanf("%d%d",&a,&b)
#define sfff(a,b,c)     scanf("%d%d%d",&a,&b,&c)
#define loop(i,n)       for(int i=0;i<n;i++)
#define REP(i,a,b)      for(int i=a;i<b;i++)
#define TEST_CASE(t)    for(int z=1;z<=t;z++)
#define PRINT_CASE      printf("Case %d: ",z)
#define all(a)          a.begin(),a.end()
#define intlim          2147483648
#define inf             1000000
#define ull             unsigned long long


using namespace std;

const int fx[]={+1,-1,+0,+0};
const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move

bool visited[30][30];
int d[30][30];

void BFS(pii x)
{
    d[x.ff][x.ss]=0;
    queue<pii>Q;
    visited[x.ff][x.ss]=0;
    Q.push(x);
    while(!Q.empty())
    {
        pii u=Q.front();
        Q.pop();
        for(int i=0;i<4;i++)
        {
            pii v;
            v.ff=u.ff+fx[i];
            v.ss=u.ss+fy[i];
            if(!visited[v.ff][v.ss])
            {
                visited[v.ff][v.ss]=1;
                d[v.ff][v.ss]=d[u.ff][u.ss]+1;
                Q.push(v);
            }
        }
    }
}

int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    int t,m,n;
    sf(t);
    TEST_CASE(t)
    {
        sff(m,n);
        ms(visited,0);
        ms(d,0);
        pii a,b,c,h;
        char ch;
       // getchar();
        REP(i,0,m)
            REP(j,0,n)
                {
                    cin>>ch;
                    //getchar();
                    if(ch=='#' || ch=='m')
                        visited[i][j]=1;
                    else if(ch=='h')
                        h.ff=i,h.ss=j;
                    else if(ch=='a')
                        a.ff=i,a.ss=j;
                    else if(ch=='b')
                        b.ff=i,b.ss=j;
                    else if(ch=='c')
                        c.ff=i,c.ss=j;
                }
        BFS(h);
        int ans=d[a.ff][a.ss];
        ans=max(ans,d[b.ff][b.ss]);
        ans=max(ans,d[c.ff][c.ss]);
        PRINT_CASE;
        pf("%d\n",ans);
    }
    return 0;
}