Command of the Mayor

To ensure victory in the elections, the mayor decided to build a team of his friends, where everyone is a friend of each other. Knowing the relationship between an all N acquaintances mayor to build a team the greatest number of M. When the existence of multiple solutions is sufficient to derive only one of them.

Specifications

Input

The first line is a single number N - the number of acquaintances Mayor (N < 50). In the second row - the number of K - the number of couples who have friendly relations. The following K lines through space-separated pair of numbers - numbers of friends.

Output

The first line of a single number - the largest squad of the mayor. The next line through the gap of the mayor's team in ascending numerical order.

Problem information

Time Limit: 1 seconds
Memory Limit: 64 MB
Balls for the passed test: 11.1111
Complexity: 24% 61/80

Example

Example input

Example output

3
1 2 3

← Pipeline (RU)

Problems

Green spot →