#include <cstdio>

 #include <iostream>

 #include <cstring>

 #include <fstream>

 using namespace std;

 const int MAXN = 2e3+;

 int Par[MAXN];

 bool Rank[MAXN];

 void Init()

 {

     memset(Par, -, sizeof(Par));

     memset(Rank, , sizeof(Rank));

 }

 int Find(int x)

 {

     if(Par[x] == -)

         return x;

     int t = Par[x];

     Par[x] = Find(Par[x]);

     Rank[x] = Rank[t]^Rank[x];

     return Par[x];

 }

 int main()

 {

     //freopen("input.txt", "r", stdin);

     int T, N, M;

     scanf("%d", &T);

     for(int Cnt = ; Cnt <= T; Cnt++)

     {

         if(Cnt!=)

             printf("\n");

         Init();

         int x, y, fx, fy;

         bool ans = true;

         scanf("%d %d", &N, &M);

         for(int i = ; i < M; i++)

         {

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

             if(ans)

             {

                 fx = Find(x);

                 fy = Find(y);

                 if(fx == fy && Rank[x] == Rank[y])

                 {

                     ans = false;

                 }

                 else if(fx != fy)

                 {

                     Par[fx] = fy;

                     Rank[fx] = Rank[x]^(Rank[y]^);

                 }

             }

         }

         if(ans)

         {

             printf("Scenario #%d:\nNo suspicious bugs found!\n", Cnt);

         }

         else

         {

             printf("Scenario #%d:\nSuspicious bugs found!\n", Cnt);

         }

     }

     return ;

 }