CF1100E.Andrew and Taxi

Andrew prefers taxi to other means of transport, but recently most taxi drivers have been acting inappropriately. In order to earn more money, taxi drivers started to drive in circles. Roads in Andrew's city are one-way, and people are not necessary able to travel from one part to another, but it pales in comparison to insidious taxi drivers.

The mayor of the city decided to change the direction of certain roads so that the taxi drivers wouldn't be able to increase the cost of the trip endlessly. More formally, if the taxi driver is on a certain crossroads, they wouldn't be able to reach it again if he performs a nonzero trip.

Traffic controllers are needed in order to change the direction the road goes. For every road it is known how many traffic controllers are needed to change the direction of the road to the opposite one. It is allowed to change the directions of roads one by one, meaning that each traffic controller can participate in reversing two or more roads.

You need to calculate the minimum number of traffic controllers that you need to hire to perform the task and the list of the roads that need to be reversed.

安德鲁更喜欢乘坐出租车，而不是其他交通工具，但最近大多数出租车司机的行为都变得不恰当。为了赚取更多收入，出租车司机开始绕圈行驶。安德鲁所在城市的道路均为单向；人们未必能从城市的一个区域到达另一个区域，但这与阴险的出租车司机相比，已显得微不足道。

该市市长决定改变某些道路的行驶方向，以防止出租车司机无限抬高行程费用。更准确地说：若出租车司机位于某个路口，则他执行一段非零长度的行程后，将无法再次回到该路口。

需要交通管制员来改变道路的行驶方向。对于每条道路，已知将其方向反转所需的交通管制员人数。允许逐条改变道路方向，即每位交通管制员可参与两条或更多道路的反向操作。

你需要计算完成该任务所需雇佣的交通管制员的最少人数，并列出需要被反向的道路列表。

The first line contains two integers $n$ and $m$ ($2 \leq n \leq 100\,000$, $1 \leq m \leq 100\,000$) — the number of crossroads and the number of roads in the city, respectively.

Each of the following $m$ lines contain three integers $u_{i}$, $v_{i}$ and $c_{i}$ ($1 \leq u_{i}, v_{i} \leq n$, $1 \leq c_{i} \leq 10^9$, $u_{i} \ne v_{i}$) — the crossroads the road starts at, the crossroads the road ends at and the number of traffic controllers required to reverse this road.

第一行包含两个整数 $n$ 和 $m$（$2 \leq n \leq 100\,000$，$1 \leq m \leq 100\,000$）—— 分别表示城市中交叉路口的数量和道路的数量。

接下来的 $m$ 行，每行包含三个整数 $u_{i}$、$v_{i}$ 和 $c_{i}$（$1 \leq u_{i}, v_{i} \leq n$，$1 \leq c_{i} \leq 10^9$，$u_{i} \ne v_{i}$）—— 分别表示该道路的起点交叉路口、终点交叉路口，以及反转该道路所需的交通管制员数量。

In the first line output two integers the minimal amount of traffic controllers required to complete the task and amount of roads $k$ which should be reversed. $k$ should not be minimized.

In the next line output $k$ integers separated by spaces — numbers of roads, the directions of which should be reversed. The roads are numerated from $1$ in the order they are written in the input. If there are many solutions, print any of them.

第一行输出两个整数：完成任务所需的最少交通管制员数量，以及需要反转方向的道路数量 $k$。注意：$k$ 不必最小化。

第二行输出 $k$ 个用空格分隔的整数——即需要反转方向的道路编号。道路按输入中出现的顺序从 $1$ 开始编号。若存在多种解，输出任意一种即可。

There are two simple cycles in the first example: $1 \rightarrow 5 \rightarrow 2 \rightarrow 1$ and $2 \rightarrow 3 \rightarrow 4 \rightarrow 5 \rightarrow 2$. One traffic controller can only reverse the road $2 \rightarrow 1$ and he can't destroy the second cycle by himself. Two traffic controllers can reverse roads $2 \rightarrow 1$ and $2 \rightarrow 3$ which would satisfy the condition.

In the second example one traffic controller can't destroy the cycle $ 1 \rightarrow 3 \rightarrow 2 \rightarrow 1 $. With the help of three controllers we can, for example, reverse roads $1 \rightarrow 3$ ,$ 2 \rightarrow 4$, $1 \rightarrow 5$.

第一个样例中有两个简单环：$1 \rightarrow 5 \rightarrow 2 \rightarrow 1$ 和 $2 \rightarrow 3 \rightarrow 4 \rightarrow 5 \rightarrow 2$。一名交通管制员只能翻转道路 $2 \rightarrow 1$，但他无法独自破坏第二个环。两名交通管制员可以翻转道路 $2 \rightarrow 1$ 和 $2 \rightarrow 3$，从而满足条件。

第二个样例中，一名交通管制员无法破坏环 $1 \rightarrow 3 \rightarrow 2 \rightarrow 1$。借助三名管制员，我们可以（例如）翻转道路 $1 \rightarrow 3$、$2 \rightarrow 4$、$1 \rightarrow 5$。