#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <cstring>
#include <stdlib.h>
using namespace std;
int father[100001], rankk[100001], flag, n;
int get_fa(int x)
{
if(x != father[x])
{
int t;
t = get_fa(father[x]);
rankk[x]=(rankk[x]+rankk[father[x]])%2;
father[x] = t;
return t;
}
return father[x];
}
void merge(int a, int b)
{
int fa, fb;
fa = get_fa(a), fb = get_fa(b);
if(fa == fb)
{
if(rankk[a] == rankk[b])
flag = 0;
}
else
{
father[fa] = fb;
rankk[fa] = (rankk[a] + rankk[b] + 1) % 2;
}
}
int main()
{
int T,m,i,a,b,t;
scanf("%d",&T);
for(t=1; t<=T; ++t)
{
scanf("%d%d",&n,&m);
flag=1;
memset(rankk,0,sizeof(rankk));
for(i=1; i<=n; ++i)
father[i]=i;
while(m--)
{
scanf("%d%d",&a,&b);
if(!flag)
continue;
merge(a,b);
}
printf("Scenario #%d:\n",t);
if(flag)
printf("No suspicious bugs found!\n\n");
else
printf("Suspicious bugs found!\n\n");
}
return 0;
}