#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n)-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(b)-1;i>=(a);--i)
#define ALL(a) a.begin(),a.end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template <typename T1, typename T2>
bool chmax(T1 &a, const T2 &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template <typename T1, typename T2>
bool chmin(T1 &a, const T2 &b) {
    if (a > b) { a = b; return true; }
    return false;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "{";
    int a = 0;
    for (auto &tp : mp) {
        if (a) os << ", ";
        a = 1;
        os << tp;
    }
    return os << "}";
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    os << p.first << ":" << p.second;
    return os;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int T; cin >> T;
    while (T--) {
        int H, W; cin >> H >> W;
        vector<string> S(H);
        REP(i, H) cin >> S[i];
        for (bool updated = 1; updated;) {
            updated = 0;
            vi top(26, H), bottom(26, -1), left(26, W), right(26, -1);
            map<char,int> exist;
            REP(i, H) {
                REP(j, W) {
                    if (S[i][j] == '.' or S[i][j] == '#') continue;
                    chmin(top[S[i][j]-'A'], i);
                    chmax(bottom[S[i][j]-'A'], i);
                    chmin(left[S[i][j]-'A'], j);
                    chmax(right[S[i][j]-'A'], j);
                    exist[S[i][j]] = 1;
                }
            }
            for (auto &tp : exist) {
                char c = tp.first;
                bool square = 1;
                FOR(i, top[c-'A'], bottom[c-'A']+1) {
                    FOR(j, left[c-'A'], right[c-'A']+1) {
                        if (S[i][j] != c and S[i][j] != '#') {
                            square = 0;
                        }
                    }
                }
                if (!square) continue;
                FOR(i, top[c-'A'], bottom[c-'A']+1) {
                    FOR(j, left[c-'A'], right[c-'A']+1) {
                        S[i][j] = '#';
                    }
                }
                updated = 1;
            }
        }

        bool ans = 1;
        REP(i, H) {
            REP(j, W) {
                if (S[i][j] != '.' and S[i][j] != '#') {
                    ans = 0;
                }
            }
        }
        cout << (ans ? "SAFE" : "SUSPICIOUS") << endl;
    }

    return 0;
}



Measured memory_bytes: 3168