Party#4327
Byteasar intends to throw 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 whom 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 (2/3) \cdot n of his friends, and everyone knew everyone else. Unfortunately, Byteasar does not remember anything else from that party... In particular, he does not remember 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 does not know how to choose them, so he asks you for help.
The first line contains two integers and (3 \leq n \leq 1000, 0 \leq m \leq n(n-1)/2), separated by a 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 contains two integers, separated by a space. The numbers in the (i+1)-th line (i = 1, 2, \ldots, m) are a_i and b_i (1 \leq a_i < b_i \leq n), which means that persons a_i and b_i know each other. Each pair appears at most once in the input.
Print numbers in increasing order in a single line, separated by spaces. These numbers specify the indices of Byteasar's friends whom he should invite to the party. If there are multiple solutions, print any one of them.
Example 1