////***************Copy Right 2021 < BUNNY />  *********************////
//////************* ولسوف يعطيك ربك فترضي *****************/
// Sometimes, the questions are complicated - and the answers are simple. //
///////*********************** (ACPC Next Year) *************************////
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define f first
#define s second
#define Ya_Rab_Accepted ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

void LoL_Code_Bela_Hadaf_() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
}

int MOD = 1e9 + 7;
const long long INF = 1e18, N = 1e6+100;
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
vector<int>adj[N];
int color[N];
void dfs(int node){
    for(auto child : adj[node]){
        if(color[child] == -1){
            color[child] = !color[node];
            dfs(child);
        }
    }
}

int main() {
    Ya_Rab_Accepted
    LoL_Code_Bela_Hadaf_();


    int t, tc = 0;  cin>>t;

    while(t--){
        tc++;
        memset(color, -1, sizeof color);
        for(auto i : adj)
            i.clear();
        int n, m;
        cin>>n>>m;
        vector<pair<int, int>>edges(m+1);
        for(int i = 0;i<m;i++){
            int x, y;
            cin>>x>>y;
            adj[x].push_back(y);
            adj[y].push_back(x);
            edges.push_back({x, y});
        }
        for(int i = 1;i<=n;i++){
            if(color[i] == -1){
                dfs(i);
            }
        }



        bool flag = false;
        for(auto i : edges){
            flag |= (color[i.f] == color[i.s]);
        }

        cout<<"Scenario #"<<tc<<":\n";
        if(flag)
            cout<<"Suspicious bugs found!\n";
        else
            cout<<"No suspicious bugs found!\n";

    }




    return 0;

}