B"You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessarily connected. Guaranteed, that the graph does not contain multiple edges (more than one edges between a pair of vertices) or loops (edges from a vertex to itself). A cycle in a graph is called a simple, if it contains each own vertex exactly once. So simple cycle doesn't allow to visit a vertex more than once in a cycle. Determine the edges, which belong to exactly on one simple cycle. The first line contain two integers n and m (1 <= n <= 100 ,000 , 0 <= m <= min(n cdot (n - 1) / 2, 100 ,000)) -- the number of vertices and the number of edges. Each of the following m lines contain two integers u and v ( 1 <= u, v <= n , u neq v ) -- the description of the edges. In the first line print the number of edges, which belong to exactly one simple cycle. In the second line print the indices of edges, which belong to exactly one simple cycle, in increasing order. The edges are numbered from one in the same order as they are given in the input. "...