#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(register int i=x;i>=y;--i)
#define ll long long
using namespace std;
const int N=1e4+7;
int f[N],rl[N],T,a,b,cnt,ans,n,m;

int (int x){
    if(f[x]==x)return x;
    int t=find(f[x]);
    rl[x]=(rl[x]+rl[f[x]])&1;   
    return f[x]=t;
}

inline int un(int x,int y){
    int a=find(x);
    int b=find(y);
    if(a==b)if(rl[x]==rl[y])return ans=1;
    f[b]=a;
    rl[b]=(rl[x]-rl[y]+1)&1;
    return 0;
}


int main(){
    scanf("%d",&T);
    while(T--){
        ans=0;
        scanf("%d%d",&n,&m);
        memset(rl,0,sizeof(rl));
        rep(i,1,n)f[i]=i;
        printf("Scenario #%d:n",++cnt);
        rep(i,1,m){
            scanf("%d%d",&a,&b);
            if(ans)continue;
            if(un(a,b))puts("Suspicious bugs found!n");
        }
        if(!ans)puts("No suspicious bugs found!n");
    }
    return 0;
}