import sys
sys.setrecursionlimit(1000005)

def bipartite(adj, color, source):

    if visited[source] == 0:
        visited[source] = color
        if color == 1: color = 2
        else: color = 1

        for v in adj[source]:

            if visited[v] == 0:
                if bipartite(adj, color, v) == -1:
                	return -1
            elif visited[v] == visited[source]:
                #print 'not bipartite'
                return -1



for i in xrange(1,int(raw_input())+1):
    p,q = map(int, raw_input().split())
    global visited
    flag = True
    visited = [0]*p
    adj = {}
    for x in range(p): adj[x] = []
    for _ in xrange(q):
        m,n = map(int, raw_input().split())
        adj[m-1].append(n-1)
        adj[n-1].append(m-1)


    print 'Scenario #%i:'% i
    for source in range(p):
        if visited[source] == 0:
            if bipartite(adj, 1, source) == -1:
                print 'Suspicious bugs found!'
                flag = False
                break
    if flag:
        print 'No suspicious bugs found!'