Description

Background

Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.

Problem

Given a list of bug 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.

Input Format

The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.

Output Format

The output for every scenario is a line containing "Scenario #i:", where i is the number of the scenario starting at 1, followed by one line saying either "No suspicious bugs found!" if the experiment is consistent with his assumption about the bugs' sexual behavior, or "Suspicious bugs found!" if Professor Hopper's assumption is definitely wrong.

2
3 3
1 2
2 3
1 3
4 2
1 2
3 4​

Scenario #1:
Suspicious bugs found!
​Scenario #2:

No suspicious bugs found!

Hint

题目大意：你知道小昆虫里也有同性恋吗，Professor Hopper做了一个实验，想知道每一个昆虫群中有没有同性恋，方法是如果虫子之间的恋爱关系形成环，则存在同性恋！

对于样例: 3,3表示3个数(1,2,3)，接下来3行表示3组关系； 1 2表示1,2是恋爱关系； 2 3表示2,3是恋爱关系； 1 3表示1,3是恋爱关系； 所以这3个人中存在同性恋，输出“Suspicious bugs found!”； 对于不存在同性恋的情况输出“No suspicious bugs found!”；

Source

并查集