**译自 POI 2011 Round 3. Day 1. A「Party」**

Byteasar intends to throw up a party. Naturally, he would like it to be a success. Furthermore, Byteasar is quite certain that to make it so it suffices if all invited guests know each other. He is currently trying to come up with a list of his friends he would like to invite.

Byteasar has friends, where is divisible by . Fortunately, most of Byteasar's friends know one another. Furthermore, Byteasar recalls that he once attended a party where there were of his friends, and where everyone knew everyone else. Unfortunately, Byteasar does not quite remember anything else from that party... In particular, he has no idea which of his friends attended it.

Byteasar does not feel obliged to throw a huge party, but he would like to invite at least of his friends. He has no idea how to choose them, so he asks you for help.

In the first line of the standard input two integers, and (, ), are given, separated by a single space. These denote the number of Byteasar's friends and the number of pairs of his friends who know each other, respectively. Byteasar's friends are numbered from to . Each of the following lines holds two integers separated by a single space. The numbers in line no. (for ) are and (), separated by a single space, which denote that the persons and know each other. Every pair of numbers appears at most once on the input.

In the first and only line of the standard output your program should print numbers, separated by single spaces, in increasing order. These number should specify the numbers of Byteasar's friends whom he should invite to the party. As there are multiple solutions, pick one arbitrarily.

For the input data:

```
6 10
2 5
1 4
1 5
2 4
1 3
4 5
4 6
3 5
3 4
3 6
```

the correct result is:

```
2 4
```

Explanation of the example:

Byteasar's friends numbered know one another. However, any pair of Byteasar's friends who know each other, like and for instance, constitutes a correct solution, i.e., such a pair needs not be part of aforementioned quadruple.

Task author: Jakub Onufry Wojtaszczyk.

**暂时没有 SPJ > <**

LibreOJ Powered by SYZOJ.