#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int rel[2010];
int fa[2010];
int find( int a)
{
if( a != fa[a])
fa[a] = find(a);
return fa[a];
}
void fan( int a, int b)
{
int pa = find(a);
int pb = find(b);
if(pb != pa)
fa[pa] = pb;
}
int main()
{
int n;
int i, j, k, l, x ,y;
int num,que;
int a,b;
scanf("%d",&n);
for( i = 0; i<n; i++)
{
memset(rel,-1,sizeof(rel));
bool flag = false;
for( l=0; l<=num; l++)
fa[l] = l ;
scanf("%d %d",&num, &que);
for( k = 0; k < que; k++)
{
scanf("%d %d",&a, &b);
if(flag) continue;
if(rel[a] == -1)
{
if(rel[b] != 1)
fan(a,rel[b]);
rel[a] = b;
rel[b] = a;
}
else if(rel[a] != -1)
{
if(rel[b] == -1)
{
fan(b,rel[a]);
rel[a] = b;
rel[b] = a;
}
else
{
if(find(a) == find(b))
{
flag = true;
continue;
}
else
{
fan(a, rel[b]) ;
fan(b, rel[a]) ;
}
}
}
}
if(flag) printf("Scenario #%d:\nSuspicious bugs found!\n\n", i+1) ;
else printf("Scenario #%d:\nNo suspicious bugs found!\n\n", i+1) ;
}
}
#include <stdio.h>
#include <string.h>
using namespace std;
int rel[2010];
int fa[2010];
int find( int a)
{
if( a != fa[a])
fa[a] = find(a);
return fa[a];
}
void fan( int a, int b)
{
int pa = find(a);
int pb = find(b);
if(pb != pa)
fa[pa] = pb;
}
int main()
{
int n;
int i, j, k, l, x ,y;
int num,que;
int a,b;
scanf("%d",&n);
for( i = 0; i<n; i++)
{
memset(rel,-1,sizeof(rel));
bool flag = false;
for( l=0; l<=num; l++)
fa[l] = l ;
scanf("%d %d",&num, &que);
for( k = 0; k < que; k++)
{
scanf("%d %d",&a, &b);
if(flag) continue;
if(rel[a] == -1)
{
if(rel[b] != 1)
fan(a,rel[b]);
rel[a] = b;
rel[b] = a;
}
else if(rel[a] != -1)
{
if(rel[b] == -1)
{
fan(b,rel[a]);
rel[a] = b;
rel[b] = a;
}
else
{
if(find(a) == find(b))
{
flag = true;
continue;
}
else
{
fan(a, rel[b]) ;
fan(b, rel[a]) ;
}
}
}
}
if(flag) printf("Scenario #%d:\nSuspicious bugs found!\n\n", i+1) ;
else printf("Scenario #%d:\nNo suspicious bugs found!\n\n", i+1) ;
}
}