#include<bits/stdc++.h>

#define forn(i, n) for (int i = 0 ; i < int(n) ; i++)

#define fore(i, s, t) for (int i = s ; i < (int)t ; i++)

#define fi first

#define se second

#define all(x) x.begin(),x.end()

#define pf2(x,y) printf("%d %d\n",x,y)

#define pf(x) printf("%d\n",x)

#define each(x) for(auto it:x)  cout<<it<<endl;

#define pii pair<int,int>

using namespace std;

typedef long long ll;

const int maxn=4e5+5;

const int maxm=2e5+5;

const int inf=1e9;

int n,m;

vector<string> a;

int calc(){

	int total=0;

	vector<int> row(n,0),col(m,0);

	for(int i=0;i<n;i++)

		for(int j=0;j<m;j++)

			if(a[i][j]=='A') {

				row[i]++;

				col[j]++;

				total++;

			}

	if(total==0) return -1;

	if(total==n*m) return 0;

	if(row[0]==m || row.back()==m || col[0]==n || col.back()==n) return 1;

	if(a[0][0]=='A' || a[0].back()=='A' || a[n-1][0]=='A' || a[n-1].back()=='A') return 2;

	if(*max_element(all(row))==m || *max_element(all(col))==n) return 2;

	if(row[0] || row.back() || col[0] || col.back()) return 3;

	return 4;

}

void solve(){

	cin>>n>>m;

	a.resize(n);

	for(int i=0;i<n;i++)

		cin>>a[i];

	int re=calc();

	if(re==-1) puts("MORTAL");

	else cout<<re<<"\n";

}

int main(){

	int t;

	cin>>t;

	while(t--)

		solve();

}