#include <bits/stdc++.h>
#define inf 1000000007
#define mod 1000000007
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
const int dx[]={-1,1,0,0},dy[]={0,0,-1,1};
int wx[4],wy[4];
int n,m,t;
int spx,spy,sbx,sby,tpx,tpy,tbx,tby;
char mp[500005];
namespace bp1
{
	int dist[5005][5005];
	int get(int x,int y)
	{
		return (x-1)*m+y;
	}
	void solve()
	{
		wx[0]=n;wy[0]=(m+1)/2;
		wx[1]=1;wy[1]=(m+1)/2;
		wx[2]=(n+1)/2;wy[2]=m;
		wx[3]=(n+1)/2;wy[3]=1;
		for(int i=1;i<=n*m;++i)
			for(int j=1;j<=n*m;++j)
				dist[i][j]=inf;
		dist[get(spx,spy)][get(sbx,sby)]=0;
		deque<pair<pair<int,int>,pair<int,int>>> q;
		q.push_back({{spx,spy},{sbx,sby}});
		while(!q.empty())
		{
			auto p=q.front();q.pop_front();
			int px=p.first.first,py=p.first.second;
			int bx=p.second.first,by=p.second.second;
			for(int d=0;d<4;++d)
			{
				int pxx=px+dx[d],pyy=py+dy[d];
				int bxx=bx+dx[d],byy=by+dy[d];
				if(pxx==bx&&pyy==by&&bxx>=1&&bxx<=n&&byy>=1&&byy<=m&&mp[get(bxx,byy)]=='.'&&dist[get(pxx,pyy)][get(bxx,byy)]>dist[get(px,py)][get(bx,by)]+1)
				{
					dist[get(pxx,pyy)][get(bxx,byy)]=dist[get(px,py)][get(bx,by)]+1;
					q.push_back({{pxx,pyy},{bxx,byy}});
				}
				else if(pxx>=1&&pxx<=n&&pyy>=1&&pyy<=m&&mp[get(pxx,pyy)]=='#')
				{
					continue;
				}
				else if(pxx>=1&&pxx<=n&&pyy>=1&&pyy<=m&&mp[get(pxx,pyy)]=='.'&&(pxx!=bx||pyy!=by)&&dist[get(pxx,pyy)][get(bx,by)]>dist[get(px,py)][get(bx,by)])
				{
					dist[get(pxx,pyy)][get(bx,by)]=dist[get(px,py)][get(bx,by)];
					q.push_front({{pxx,pyy},{bx,by}});
				}
				else if(pxx==bx&&pyy==by&&(bxx<1||bxx>n||byy<1||byy>m))
				{
					continue;
				}
				else if(pxx==bx&&pyy==by&&bxx>=1&&bxx<=n&&byy>=1&&byy<=m&&mp[get(bxx,byy)]=='#'&&mp[get(wx[d],wy[d])]=='#')
				{
					continue;
				}
				else if(pxx==bx&&pyy==by&&bxx>=1&&bxx<=n&&byy>=1&&byy<=m&&mp[get(bxx,byy)]=='#'&&mp[get(wx[d],wy[d])]=='.'&&dist[get(wx[d],wy[d])][get(bx,by)]>dist[get(px,py)][get(bx,by)])
				{
					dist[get(wx[d],wy[d])][get(bx,by)]=dist[get(px,py)][get(bx,by)];
					q.push_front({{wx[d],wy[d]},{bx,by}});
				}
				else if((pxx<1||pxx>n||pyy<1||pyy>m)&&bxx>=1&&bxx<=n&&byy>=1&&byy<=m&&mp[get(bxx,byy)]=='#')
				{
					continue;
				}
				else if((pxx<1||pxx>n||pyy<1||pyy>m)&&(bxx<1||bxx>n||byy<1||byy>m))
				{
					continue;
				}
				else if((pxx<1||pxx>n||pyy<1||pyy>m)&&bxx>=1&&bxx<=n&&byy>=1&&byy<=m&&mp[get(bxx,byy)]=='.'&&dist[get(bxx,byy)][get(bx,by)]>dist[get(px,py)][get(bx,by)])
				{
					dist[get(bxx,byy)][get(bx,by)]=dist[get(px,py)][get(bx,by)];
					q.push_front({{bxx,byy},{bx,by}});
				}
			}
		}
		writeln(dist[get(tpx,tpy)][get(tbx,tby)]==inf?-1:dist[get(tpx,tpy)][get(tbx,tby)]);
	}
}
signed main()
{
	// freopen("parabox.in","r",stdin);
	// freopen("parabox.out","w",stdout);
	int tc;read(tc);
	while(tc--)
	{
		read(n);read(m);t=0;
		for(int i=1;i<=n;++i)
		{
			scanf("%s",mp+t+1);
			for(int j=1;j<=m;++j)
				if(mp[t+j]=='p')
					spx=i,spy=j,mp[t+j]='.';
				else if(mp[t+j]=='b')
					sbx=i,sby=j,mp[t+j]='.';
				else if(mp[t+j]=='=')
					tpx=i,tpy=j,mp[t+j]='.';
				else if(mp[t+j]=='-')
					tbx=i,tby=j,mp[t+j]='.';
			t+=m;
		}
		if(n*m<=5000) bp1::solve();
	}
	return 0;
}