まるでチェスをしているかのような BFS
//====================================================================||
// ||
// ||
// 著者 : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 105
#define PII pair<int,int\>
#define PB push\_back
#define oo (1<<29)
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
char mz\[M\]\[M\];
int nx,ny;
int dx\[8\]={-2,-1,1,2,2,1,-1,-2};
int dy\[8\]={-1,-2,-2,-1,1,2,2,1};
int kdx\[8\]={-1,0,1,1,1,0,-1,-1};
int kdy\[8\]={-1,-1,-1,0,1,1,1,0};
int ex,ey,bx,by;
int qx\[M\*M\*2\];
int qy\[M\*M\*2\];
int dis\[M\]\[M\];
int front,rear;
void solve(){
fill(&dis\[0\]\[0\],&dis\[M-1\]\[M-1\],oo);
front=rear=0;
qx\[front\]=bx;
qy\[front++\]=by;
dis\[by\]\[bx\]=0;
int xx=0;
while(front>rear){
int x=qx\[rear\];
int y=qy\[rear++\];
int d=dis\[y\]\[x\];
for(int i=0;i<8;i++){
int nex=x+kdx\[i\];
int ney=y+kdy\[i\];
// debug(">>> %d %d %d\\n",nex,ney,xx);
if(nex<0||nex>=nx||ney<0||ney>=ny)continue;
if(mz\[ney\]\[nex\]=='Z'||mz\[ney\]\[nex\]=='z')continue;
if(d+1<dis\[ney\]\[nex\]){
dis\[ney\]\[nex\]=d+1;
qx\[front\]=nex;
qy\[front++\]=ney;
}
}
xx++;
}
if(dis\[ey\]\[ex\]==oo){
printf("ピーター王、今は行けません！\\n");
}else printf("旅行の最小可能距離は %d\\n",dis\[ey\]\[ex\]);
}
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d",&test);
while(test--){
Set(mz,0);
scanf("%d%d",&ny,&nx);
for(int i=0;i<ny;i++){
scanf("%s",mz\[i\]);
}
for(int i=0;i<ny;i++){
for(int j=0;j<nx;j++){
if(mz\[i\]\[j\]=='A'){
bx=j;by=i;
}else if(mz\[i\]\[j\]=='B'){
ex=j;ey=i;
}else if(mz\[i\]\[j\]=='Z'){
for(int k=0;k<8;k++){
int nex=j+dx\[k\],ney=i+dy\[k\];
if(nex<0||nex>=nx||ney<0||ney>=ny)continue;
if(mz\[ney\]\[nex\]=='B'||mz\[ney\]\[nex\]=='A')continue;
if(mz\[ney\]\[nex\]!='Z')mz\[ney\]\[nex\]='z';
}
}
}
}
// for(int i=0;i<ny;i++){
// puts(mz\[i\]);
// }
// debug("%d %d\\n",bx,by);
// debug("%d %d\\n",ex,ey);
solve();
}
}