Professor Hatim is researching the sexual behavior of a rare species of lizard. He assumes that they feature two different genders and that they only interact with lizard of the opposite gender. Each lizard has a integer printed on their back.

Given the details of lizard interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs, or if it contains some bug interactions that falsify it. Or simply, you have to print "Suspicious lizard found!" (without quotes), if an interaction of two lizards of same gender is found in the list of interactions, otherwise print "No suspicious lizard found!" (without quotes).  

Input format:
The first line contains an integer T, denoting the number of test cases.
The first line of each test case contains two integers N and M, where N denotes the number of lizards and M denotes the number of interactions.
Next M lines of each test case contains, two space separated integers, say x and y , denoting the interaction between lizard no. x and lizard no. y.  

Note: Integers on the back of lizards are numbered from 1 to N.

Output format:
For each test case ,print a line, saying either “No suspicious lizard found!” if the experiment is consistent with his assumption about the lizard sexual behavior, or “Suspicious lizard found!” if Professor Hatims’s assumption is definitely wrong.  

Constraints:
1 ≤ T ≤ 5
2 ≤ N ≤ 2000
1 ≤ M ≤ 10^5

SAMPLE INPUT
2
3 3
1 2
2 3
1 3
4 2
1 2
3 4

SAMPLE OUTPUT
Suspicious lizards found!
No suspicious lizards found!
for _ in range(int(raw_input())):
    n,m=map(int,raw_input().split())
    a=[[] for i in range(n)]
    color=[0]*n
    def bipartite_visit(v,clr):
        color[v]=clr
        for i in range(len(a[v])):
            if color[a[v][i]]==color[v]:
                return 0
            elif color[a[v][i]]==0:
                if color[v]==1:
                    if not bipartite_visit(a[v][i],2):
                        return 0
                else:
                    if not bipartite_visit(a[v][i],1):
                        return 0
        return 1
    def isbipartite():
        for i in range(n):
            if color[i]==0:
                if not bipartite_visit(i,1):
                    return 0
        return 1
    for i in range(m):
        u,v=map(int,raw_input().split())
        u,v=u-1,v-1
        a[u].append(v)
        a[v].append(u)
    if not isbipartite():
        print "Suspicious lizards found!"
    else:
        print "No suspicious lizards found!"