#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;

bool solve(set<pair<char,char> > &g,string &pr)
{
  do{
    bool f=true;
    for (int i=0;i<pr.size();i++)
      for (int j=i+1;j<pr.size();j++)
        if (g.count(make_pair(pr[i],pr[j])))
          f=false;
    if (f) return true;
  }while(next_permutation(pr.begin(),pr.end()));
  return false;
}

int main()
{
  int cases;cin>>cases;
  while(cases--){
    int h,w;cin>>h>>w;
    vector<string> vs;
    set<char> ss;
    for (int i=0;i<h;i++){
      string s;cin>>s;
      vs.push_back(s);
      ss.insert(s.begin(),s.end());
    }
    set<pair<char,char> > g;
    string pr(ss.begin(),ss.end());
    for (int i=0;i<pr.length();i++){
      int a=pr[i];
      int lux=500,luy=500,rdx=-500,rdy=-500;
      for (int y=0;y<h;y++)
        for (int x=0;x<w;x++)
          if (vs[y][x]==a)
            lux<?=x,luy<?=y,rdx>?=x,rdy>?=y;
      for (int yy=luy;yy<=rdy;yy++)
        for (int xx=lux;xx<=rdx;xx++)
          if (vs[yy][xx]!=a)
            g.insert(make_pair(a,vs[yy][xx]));
    }
    cout<<(solve(g,pr)?"SAFE":"SUSPICIOUS")<<endl;
  }
  return 0;
}