#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <algorithm>

#include <cstring>

#include <stack>

#include <cctype>

#include <queue>

#include <string>

#include <vector>

#include <set>

#include <map>

#include <climits>

#define lson root<<1,l,mid

#define rson root<<1|1,mid+1,r

#define fi first

#define se second

#define seg int root,int l,int r

#define ping(x,y) ((x-y)*(x-y))

#define mst(x,y) memset(x,y,sizeof(x))

#define mcp(x,y) memcpy(x,y,sizeof(y))

#define Min(x,y) (x<y?x:y)

#define Max(x,y) (x>y?x:y)

using namespace std;

#define gamma 0.5772156649015328606065120

#define MOD 100000007

#define inf 0x3f3f3f3f

#define N 100005

#define maxn 10001000

typedef long long LL;

typedef pair<int,int> PII;

int fp[N];

int findp(int x){return fp[x]==x?x:fp[x]=findp(fp[x]);}

int main(){

    int i,j,group,k,v,x,y,Case=,n,m;

    scanf("%d",&group);

    while(group--){

        int flag=;

        scanf("%d%d",&n,&m);

        for(i=;i<=n<<;++i) fp[i]=i;

        for(i=;i<m;++i){

            scanf("%d%d",&x,&y);

            if(!flag){

                int xa=findp(x);

                int ya=findp(y);

                if(xa==ya) flag=;

                else{

                    fp[xa]=findp(y+n);

                    fp[ya]=findp(x+n);

                }

            }

        }

        printf("Scenario #%d:\n",++Case);

        if(flag) printf("Suspicious bugs found!\n\n");

        else printf("No suspicious bugs found!\n\n");

    }

    return ;

}