You have a company and you can get/buy friendship information from several internet companies. Now, you want to hire m people who has the greatest number of connections. If there are people with the same number of friends/connections, put them in ascending order according to their total relationship costs and ids.

Question: Write a program that will read e relationship information for n people. Then, it will find m people for your company.
Notes:

1. The weight/length of relationship from one person to another is 1 if one knows the other (if person A knows person B and Person B knows Person C, then person A knows person C with the length of 2),
2. Assume that length of self-relation is zero,
3. If person A knows another (B), it does not mean that person B knows person A (the relationships are directed).
4. Assume that if one person does not know another the distance between them is max (9999),

1. the number of people (n) and
2. the number of relationships (e)
3. the number of people to show (m)

• ID of the person a: an integer between 1 and n
• ID of the person b: an integer between 1 and n

Output specification: Show m integers: the IDs (orders) of m people.

Explanation: Person 1 knows Persons 2 and 4 directly. But he knows Persons 3, 5, 6, and 7 with a length of 2. So, Person 1 knows 6 people with a total distance of (0+1+2+1+2+2+2=)10. The table below shows the number of people they know and the total distance for those people.