Grandpa Marat lives in the distant city C. He enjoys visiting friends and often spends several days moving from one friend's house to another. Each time Grandpa Marat leaves a house, he visits only the friends of the current hosts. He may visit some friends multiple times and can even return home for tea with his grandchildren. However, Grandpa Marat is very forgetful, so sometimes he forgets to return home. His grandchildren worry about him and always find him and bring him back home. Over the years, they have noticed that, before they find him, Grandpa Marat visits exactly friends (grandchildren are also considered friends).
A few days ago, Grandpa Marat went on another visit, and his grandchildren want to know where they might find him. Help them answer this question.
The first line contains three integers , , and , where is the number of houses in city C, and is the number of pairs of friends (1 \leq n \leq 1000, 1 \leq m \leq 200000, 1 \leq k \leq 10^9).
The following lines each describe a pair of friends with two integers: the numbers of the houses whose owners are friends. If the owners of house are friends with the owners of house , then the owners of house are also friends with the owners of house .
Grandpa Marat and his grandchildren live in house number .
The first line should contain the integer — the number of houses where Grandpa Marat could be found. The second line should contain integers — the house numbers where Grandpa Marat might be found, in increasing order.
Example 1