#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <functional>
#include <chrono>

using namespace std;
#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, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const double EPS = 1e-9;

const int MAX = 55;
int H, W;
string data[MAX], check[MAX];
map<char, pair<pair<int, int>, pair<int, int>>> mp;

void solve() {
    cin >> H >> W;
    vector<char> cs;
    for (int i = 0; i < H; ++i) {
        cin >> data[i];
        for (int j = 0; j < W; ++j) {
            if (isalpha(data[i][j])) {
                if (mp.count(data[i][j])) {
                    chmin(mp[data[i][j]].first.first, i);
                    chmin(mp[data[i][j]].first.second, j);
                    chmax(mp[data[i][j]].second.first, i);
                    chmax(mp[data[i][j]].second.second, j);
                } else {
                    cs.emplace_back(data[i][j]);
                    mp[data[i][j]] = make_pair(make_pair(i, j), make_pair(i, j));
                }
            }
        }
    }
    sort(cs.begin(), cs.end());
    bool f = (mp.size() == 0);
    do {
        fill(check, check + MAX, string(MAX, '.'));
        for (char c : cs) {
            int mii, mij, mai, maj;
            pair<int, int> mi, ma;
            tie(mi, ma) = mp[c];
            tie(mii, mij) = mi;
            tie(mai, maj) = ma;
            for (int i = mii; i <= mai; ++i) {
                for (int j = mij; j <= maj; ++j) {
                    check[i][j] = c;
                }
            }
        }
        if ([&]() {
            for (int i = 0; i < H; ++i) {
                for (int j = 0; j < W; ++j) {
                    if (data[i][j] != check[i][j]) {
                        return false;
                    }
                }
            }
            return true;
        }()) {
            f = true;
            break;
        }
    } while (next_permutation(cs.begin(), cs.end()));
    cout << (f ? "SAFE" : "SUSPICIOUS") << endl;
    mp.clear();
}

int main(void) {
    int test;
    cin >> test;
    REP(i, test) {
        solve();
    }
}

Measured memory_bytes: 3152