#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int (*itoi)(int);
typedef int (*iitoi)(int, int);
typedef int (*iiitoi)(int, int, int);
typedef ll (*ltol)(ll);
typedef ll (*lltol)(ll, ll);
typedef ll (*llltol)(ll, ll, ll);
const long double PI = acos(0) * 2;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
int X4[] = {-1, 0, 1, 0}, Y4[] = {0, -1, 0, 1};
int X8[] = {-1, -1, -1, 0, 1, 1, 1, 0}, Y8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
template <typename T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, 1) : 0;
}
template <typename T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, 1) : 0;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << '(' << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i];
    if (i + 1 < (int)v.size()) os << ' ';
  }
  return os;
}
const int MAX_N = 64;
int R, C;
char S[MAX_N][MAX_N];
char A = 'A', P = 'P';
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout << std::setprecision(10);
  cout << fixed;
  int q;
  cin >> q;
  while (q--) {
    cin >> R >> C;
    for (int i = 1; i <= (R); i++) cin >> (S[i] + 1);
    int ans = 5;
    int flag = 0;
    for (int i = 1; i <= (R); i++) {
      for (int j = 1; j <= (C); j++) {
        if (S[i][j] == A) {
          flag = 1;
          break;
        }
      }
    }
    if (!flag) {
      cout << "MORTAL" << endl;
      continue;
    }
    ans = 4;
    if (S[1][1] == A || S[R][1] == A || S[1][C] == A || S[R][C] == A)
      uin(ans, 2);
    flag = 1;
    for (int i = 1; i <= (R); i++) {
      if (S[i][1] != A) {
        flag = 0;
        break;
      }
    }
    if (flag) uin(ans, 1);
    flag = 1;
    for (int i = 1; i <= (R); i++) {
      if (S[i][C] != A) {
        flag = 0;
        break;
      }
    }
    if (flag) uin(ans, 1);
    flag = 1;
    for (int j = 1; j <= (C); j++) {
      if (S[1][j] != A) {
        flag = 0;
        break;
      }
    }
    if (flag) uin(ans, 1);
    flag = 1;
    for (int j = 1; j <= (C); j++) {
      if (S[R][j] != A) {
        flag = 0;
        break;
      }
    }
    if (flag) uin(ans, 1);
    flag = 0;
    for (int i = 1; i <= (R); i++) {
      if (S[i][1] == A) {
        flag = 1;
        break;
      }
    }
    if (flag) uin(ans, 3);
    flag = 0;
    for (int i = 1; i <= (R); i++) {
      if (S[i][C] == A) {
        flag = 1;
        break;
      }
    }
    if (flag) uin(ans, 3);
    flag = 0;
    for (int j = 1; j <= (C); j++) {
      if (S[1][j] == A) {
        flag = 1;
        break;
      }
    }
    if (flag) uin(ans, 3);
    flag = 0;
    for (int j = 1; j <= (C); j++) {
      if (S[R][j] == A) {
        flag = 1;
        break;
      }
    }
    if (flag) uin(ans, 3);
    for (int i = 1; i <= (R); i++) {
      flag = 1;
      for (int j = 1; j <= (C); j++) {
        if (S[i][j] != A) {
          flag = 0;
          break;
        }
      }
      if (flag) uin(ans, 2);
    }
    for (int j = 1; j <= (C); j++) {
      flag = 1;
      for (int i = 1; i <= (R); i++) {
        if (S[i][j] != A) {
          flag = 0;
          break;
        }
      }
      if (flag) uin(ans, 2);
    }
    flag = 1;
    for (int i = 1; i <= (R); i++) {
      for (int j = 1; j <= (C); j++) {
        if (S[i][j] != A) {
          flag = 0;
          break;
        }
      }
    }
    if (flag) uin(ans, 0);
    cout << ans << endl;
  }
  return 0;
}
