#include <bits/stdc++.h>
using namespace std;
#define N 30
char a[N][N];
bool v[N][N];
int n,m;
int minn=INT_MAX;
int nex1[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int nex2[2][2]={{1,0},{-1,0}};
int nex3[2][2]={{0,1},{0,-1}};

void dfs(int x,int y,int step)
{
	if(step>minn) return;
	if(x==n&&y==m)
	{
		minn=min(minn,step);
		return;
	}
	if(a[x][y]=='*') return;
	switch (a[x][y]) {
		case '+':
			for(int i=0;i<4;i++)
			{
				int nx=x+nex1[i][0];
				int ny=y+nex1[i][1];
				if(nx<1||nx>n||ny<1||ny>m) continue;
				v[nx][ny]=1;
				dfs(nx,ny,step+1);
				v[nx][ny]=0;
			}
			break;
		case '|':
			for(int i=0;i<2;i++)
			{
				int nx=x+nex2[i][0];
				int ny=y+nex2[i][1];
				if(nx<1||nx>n||ny<1||ny>m) continue;
				v[nx][ny]=1;
				dfs(nx,ny,step+1);
				v[nx][ny]=0;
			}
			break;
		case '-':
			for(int i=0;i<2;i++)
			{
				int nx=x+nex3[i][0];
				int ny=y+nex3[i][1];
				if(nx<1||nx>n||ny<1||ny>m) continue;
				v[nx][ny]=1;
				dfs(nx,ny,step+1);
				v[nx][ny]=0;
			}
			break;
	}
}
int main()
{
    std::ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
		memset(a,0,sizeof(a));
		memset(v,0,sizeof(v));
		minn=INT_MAX;
		cin>>n>>m;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				cin>>a[i][j];
			}
		}
		dfs(1,1,0);
		if(minn==INT_MAX) cout<<-1<<"\n";
		else cout<<minn<<"\n";
	}
	return 0;
}

提交记录