#include
#include
using namespace std;
int r, c;
int map[21][21];
int visit[21][21];
int alpha[27];
int dr[4] = { -1,0,1,0 };
int dc[4] = { 0,1,0,-1 };
int Maxvalue = 0;
bool Init(int nr, int nc)
{
if (nr < 0 || nr >= r || nc < 0 || nc >= c)
return true;
return false;
}
void show(int a[][21])
{
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
cout << map[i][j];
}
cout << endl;
}
cout << endl;
}
void solve(int nowr, int nowc, int cnt)
{
if (Maxvalue < cnt)
Maxvalue = cnt;
//cout << nowr << " " << nowc << endl;
for (int i = 0; i < 4; i++)
{
int nr = nowr + dr[i];
int nc = nowc + dc[i];
if (Init(nr, nc))
continue;
if (alpha[map[nr][nc]] == 1)
continue;
if (visit[nr][nc] == 1)
continue;
visit[nr][nc] = 1;
alpha[map[nr][nc]] = 1;
solve(nr, nc, cnt + 1);
visit[nr][nc] = 0;
alpha[map[nr][nc]] = 0;
}
}
int main()
{
int t;
cin >> t;
for (int tc = 1; tc <= t; tc++)
{
cin >> r >> c;
Maxvalue = 0;
for (int i = 0; i < 26; i++)
{
alpha[i] = 0;
}
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
char ch;
cin >> ch;
map[i][j] = (int)ch - 65;
visit[i][j] = 0;
}
}
alpha[map[0][0]] = 1;
solve(0,0,1);
//cout << Maxvalue << endl;
cout << "#"<<tc<<" "< }
return 0;
}
