#include <stdio.h>
int num, f[10005];
void init(int x)
{
int i;
for (i = 1; i <= x; i++)
f[i] = i;
}
int getf(int v)
{
if (f[v] == v) return v;
else
{
f[v] = getf(f[v]);
return f[v];
}
}
void merge(int v, int u)
{
int t1, t2;
t1 = getf(v);
t2 = getf(u);
if (t1 != t2) f[t2] = t1;
return;
}
int main()
{
int i, j;
while (~scanf("%d",&num))
{
int x, y;
for (i = 1; i <= num; i++)
{
int flag = 0;
scanf("%d %d", &x, &y);
init(x);
for (j = 1; j <= y; j++)
{
int a, b;
scanf("%d %d", &a, &b);
if (getf(a) == getf(b)) flag = 1;
if (flag == 1) continue;
merge(a, b);
}
printf("Scenario");
printf(" ");
printf("#%d:\n", i);
if (flag == 1)
{
printf("Suspicious");
printf(" ");
printf("bugs");
printf(" ");
printf("found!\n");
}
else
{
printf("No");
printf(" ");
printf("suspicious");
printf(" ");
printf("bugs");
printf(" ");
printf("found!\n");
}
}
}
return 0;
}