2011 Зимняя Школа, Харьков, День 8, День Виталия Гольдштейна


The undirected graph is given. Find all its bridges.


The first line contains two positive integers n and m (n20000, m200000) - the number of vertices and edges in a graph respectively. Each of the next m lines contains the description of one edge. The edge number i is described with two positive integers bi, ei (1bi, ein) - the numbers of the vertices it connects.


Print in the first line the number b of bridges in a given graph. Print on the next line b integers - the edge numbers that are bridges, in increasing order. The edges are numbered from one in the order they are given at the input.


Time limit 1 second
Memory limit 128 MiB
Input example #1
6 7
1 2
2 3
3 4
1 3
4 5
4 6
5 6
Output example #1
Author Vitaly Goldstein
Source Winter School, Kharkov, 2011, Day 9