#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

#define N 52
int h,w;
char orig[N][N];
char g[N][N];

vector<int> use;

int solve(int cnt)
{
  if (cnt==use.size()) return 1;

  int minx=INT_MAX,miny=INT_MAX,maxx=INT_MIN,maxy=INT_MIN;
  char c=use[cnt];
  for (int i=0;i<h;++i)
    for (int j=0;j<w;++j) {
      if (g[j][i]==c) {
	minx=min(minx,j);
	maxx=max(maxx,j);
	miny=min(miny,i);
	maxy=max(maxy,i);
      }
    }
  for (int i=miny;i<=maxy;++i)
    for (int j=minx;j<=maxx;++j) {
      if (g[j][i]!=c&&g[j][i]!='*') return 0;
      g[j][i]='*';
    }
  return solve(cnt+1);
}

int main()
{
  int l; scanf("%d",&l);
  while(l--) {
    use.clear();
    scanf("%d%d",&h,&w);
    for (int i=0;i<h;++i)
      for (int j=0;j<w;++j) {
	scanf(" %c",&g[j][i]);
	if (g[j][i]!='.') use.push_back(g[j][i]);
      }
    memcpy(orig,g,sizeof(g));
    sort(use.begin(),use.end());
    use.erase(unique(use.begin(),use.end()),use.end());
    int flag=0;
    do {
      memcpy(g,orig,sizeof(g));
      if (solve(0)) {
	flag=1;
	break;
      }
    } while(next_permutation(use.begin(),use.end()));
    if (flag) puts("SAFE");
    else puts("SUSPICIOUS");
  }

}