Transport nodes#1748
In the country of N-merica, there are cities. Some of these cities are connected by roads: in total, there are roads in the country. Some cities are connected by just one road, while others are real transportation hubs—many roads lead from them to other cities. In this problem, we call a city a transportation hub if at least roads are connected to it.
You are given the road network of N-merica. Find all transportation hubs in this network.
The first line contains two integers (1 \leq n \leq 10^4) and (1 \leq m \leq 10^5)—the number of cities and the number of roads, respectively. Each of the next lines describes a road and contains two integers and (1 \leq u, v \leq n, u \neq v)—the numbers of the cities that are connected by this road. The last line contains an integer (1 \leq k \leq 10^4).
Each road appears in the input at most once.
Print the number of transportation hubs in the first line. In the second line, print the numbers of these cities in ascending order.
Example 1
Example 2