topic

The ants will be moving at a speed of 1m/s, and when two ants meet, they will both turn around. When the ant reaches the edge without an exit edge, he will turn around. When you finish walking an edge, you will randomly choose an edge that is not the one you just walked on.

There is an undirected graph with $n$points, $m$edges, each edge is 1m long, each edge has an infinite number of ants, and the initial direction of the ants is uncertain.

There are now many straws that you can stick into any node, and when an ant passes through the straw, the ant dies.

In $T$seconds, the ants will destroy the world. In the worst case, at least several straws are needed to kill all ants in $T$seconds and output to which nodes.

$$$n\le 10^5,m\le 10^6$$$