Problem Background

This problem is provided by SOL, the weakest, worst, and most foolish person in the world.

The Silent Moon City website is the official site of the Perfect Information Classroom. Address: http://191.101.11.174/mgzd.

Problem Description

The servers of ACOJ are incredibly poor. Therefore, the problem setter of SAC, SOL, has to enforce that every sub-station built by downloading the ACOJ software package must provide cloud evaluation services for the main station.

The cloud evaluation service is connected through the network. This network connection is bidirectional; however, due to geographical constraints and other factors, not every two servers can be directly connected. The ACOJ main station has obtained a list of directly connected servers, which includes $n$ sub-stations (including the main station) and their $m$ connections, to allocate tasks to each sub-station.

Some sub-station owners are die-hard fans of SOL. They will unconditionally provide their servers to SOL. These ACOJ sub-stations are called "good stations." However, some sub-station owners are haters of SOL. They have obtained the ACOJ server but are unwilling to provide resources for SOL, so they use black technology to shut down the cloud service. That is, although the main station still considers these sites to exist, they will not function—neither transmitting communication nor performing evaluations. They are called "bad stations."

After arduous investigations, SOL has determined that there are at most $k$ bad stations in the ACOJ cloud evaluation system, and these $k$ bad stations seem to make the ACOJ cloud network disconnected! A major crisis!

But SOL is too stupid to determine which $k$ stations they are. So he asks you to help him find any set of $k$ stations that might make the network disconnected, to strengthen prevention.

Input Format

The input contains $m+1$ lines.

The first line contains three integers $n, m, k$.

The next $m$ lines, each containing two integers $a, b$, indicate that the stations numbered $a$ and $b$ can be directly connected.

Output Format

The output contains one line.

No more than $k$ integers, representing any set of nodes that can disconnect the original graph.

Since a Special Judge is used, the order of the nodes does not matter. Just ensure that they can disconnect the original graph.

If no such set of stations exists, output How oversuspicious you are, SOL!; if the network is already disconnected without any bad stations, output Poor SOL!.

Sample Input and Output

Sample Input #1

4 4 2
1 2
2 3
3 4
4 1

Sample Output #1

1 3

Sample Input #2

4 6 2
1 2
2 3
3 4
4 1
1 3
2 4 

Sample Output #2

How oversuspicious you are, SOL!

Sample Input #3

4 0 2

Sample Output #3

Poor SOL!

Notes

For $20\%$ of the data, $n \le 15$;

For another $20\%$ of the data, $n \le 100$, $k=1$;

For another $20\%$ of the data, $n \le 100$, $k=2$;

For $100\%$ of the data, $3 \le n \le 500$, $k \le 3$, $2 \le n - k$, the cloud network does not have self-loops or multiple edges.

见题面 Input 部分

见题面 Output 部分