You are given an undirected graph consisting of $$$n$$$ vertices and $$$m$$$ edges. The graph has no self-loops or multiple edges. It is not guaranteed that the given graph is connected.
Recall that a graph is called bipartite if it is possible to color all the vertices with two colors such that no edge connects two vertices of the same color.
Your task is to determine whether it is possible to remove no more than $$$k$$$ edges in such a way that the resulting graph becomes bipartite.
The first line contains three integers $$$n$$$, $$$m$$$, and $$$k$$$ ($$$2 \le n \le 10^3$$$; $$$1 \le m \le 10^3$$$; $$$1 \le k \le 10$$$) — the number of vertices and edges in the graph, and the maximum number of edges that can be removed.
The next $$$m$$$ lines follow, where the $$$i$$$-th line contains two integers $$$x_i$$$ and $$$y_i$$$ ($$$1 \le x_i, y_i \le n$$$; $$$x_i \ne y_i$$$), representing an edge between vertices $$$x_i$$$ and $$$y_i$$$. The given graph has no self-loops or multiple edges.
In the first line, print the number of edges (no more than $$$k$$$) that need to be removed for the graph to become bipartite. In the second line, output the indices of the edges.
If such a set of edges does not exist, output -1 in a single line.
If there are multiple suitable sets of edges, output any of them. The indices of the edges can be output in any order. Edges are numbered from $$$1$$$ to $$$m$$$ in order of the input.
4 5 11 21 32 32 43 4
1 3
4 6 11 22 34 23 43 11 4
-1
5 3 21 22 34 5
0
5 6 101 23 25 33 44 51 4
6 1 2 3 4 5 6