|Author:||Timofey S. Chistyakov||Time limit:||5 sec|
|Input file:||input.txt||Memory limit:||6 Mb|
A city road network contains N intersections connected with M roads. It is possible to reach any intersection from any other. Before winter started, city major decided to repair some roads in the city, so they wouldn't be totally ruined by spring time.
However, due to magnificent celebration of the city anniversary, city budget is considerably exhausted. That is why city administration wants to repair as little roads as possible. Some roads are already in satisfactory condition and don't need repairing. As to the other roads, the major wants to repair only those that cannot be driven around, even by the bad roads.
Your task is to help the major to obtain the list of the roads that are to be repaired.
|No.||Input file (
||Output file (|