#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=2010;
int fa[maxn];
int sex[maxn];
int n,m;
int flag;
void init()
{
for(int i=1;i<=n;i++)
{
fa[i]=i;
sex[i]=0;
}
flag=0;
}
int find(int x)
{
if(x==fa[x]) return x;
int pre=fa[x];
fa[x]=find(fa[x]);
sex[x]=(sex[pre]+sex[x])%2;
return fa[x];
}
void merge(int x,int y)
{
int xx=find(x);
int yy=find(y);
if(xx!=yy)
{
fa[xx]=yy;
sex[xx]=(1+sex[y]-sex[x])%2;
}
else
{
if(sex[x]==sex[y])
{
flag=1;
}
}
find(x);
}
int main()
{
int t;
scanf("%d",&t);
int cas=1;
while(t--)
{
int a,b;
scanf("%d%d",&n,&m);
init();
for(int i=0;i<m;i++)
{
scanf("%d%d",&a,&b);
merge(a,b);
}
if(flag==1)
{
printf("Scenario #%d:\nSuspicious bugs found!\n",cas++);
}
else printf("Scenario #%d:\nNo suspicious bugs found!\n",cas++);
cout<<endl;
}
return 0;
}