1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 #include <queue>
 5 #include <iostream>
 6 using namespace std;
 7 
 8 int father[1000005];
 9 int Q[1000005];
10 
11 int findroot(int p)
12 {
13     int r=p;
14     while(r!=father[r])
15     r=father[r];
16     return r;
17 }
18 
19 void unsion(int p,int q)
20 {
21     int fp=findroot(p);
22     int fq=findroot(q);
23     father[fq]=fp;
24 }
25 main()
26 {
27     int n, m, i, j, k=1;
28     int t;
29     cin>>t;
30     while(t--)
31     {
32         scanf("%d %d",&n,&m);
33         int flag=0, x, y;
34         for(i=1;i<=n;i++) father[i]=i;
35         memset(Q,0,sizeof(Q));
36         while(m--)
37         {
38             scanf("%d %d",&x,&y);
39             if(flag) continue;
40             int fx=findroot(x);
41             int fy=findroot(y);
42             if(fx==fy)
43             {
44                 flag=1;
45                 continue;
46             }
47             if(!Q[x]) Q[x]=y;                   
48             else unsion(Q[x],y);
49             if(!Q[y]) Q[y]=x;
50             else unsion(Q[y],x);
51         }
52         printf("Scenario #%d:\n",k++);
53         if(flag) cout<<"Suspicious bugs found!"<<endl<<endl;
54         else cout<<"No suspicious bugs found!"<<endl<<endl;
55     }
56 }