Round Trip II

Byteland has n cities and m flight connections. Your task is to design a round trip that begins in a city, goes through one or more other cities, and finally returns to the starting city. Every intermediate city on the route has to be distinct. Input The first input line has two integers n and m: the number of cities and flights. The cities are numbered 1,2,\dots,n. Then, there are m lines desc