You have cities and flight routes. Each route is a one-way flight from city to city .
Find a route from city to city that visits the maximum number of cities. Print the maximum number of cities on the route, followed by the cities in order.
If there is no route from to , print "IMPOSSIBLE".
Example:
- Input: , flights: , , , ,
- Output: and route (visits all cities)