Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. MST Company

time limit per test

8 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe MST (Meaningless State Team) company won another tender for an important state reform in Berland.

There are *n* cities in Berland, some pairs of the cities are connected by roads. Each road has its price. One can move along any road in any direction. The MST team should carry out the repair works on some set of roads such that one can get from any city to any other one moving only along the repaired roads. Moreover, this set should contain exactly *k* capital roads (that is, the roads that start or finish in the capital). The number of the capital is 1.

As the budget has already been approved, the MST Company will profit by finding the set with minimum lengths of roads.

Input

The first input line contains three integers *n*, *m*, *k* (1 ≤ *n* ≤ 5000;0 ≤ *m* ≤ 10^{5};0 ≤ *k* < 5000), where *n* is the number of cities in the country, *m* is the number of roads in the country, *k* is the number of capital roads in the required set. Then *m* lines enumerate the roads in question. Each road is specified by three numbers *a*_{i}, *b*_{i}, *w*_{i} (1 ≤ *a*_{i}, *b*_{i} ≤ *n*; 1 ≤ *w* ≤ 10^{5}), where *a*_{i}, *b*_{i} are the numbers of cities linked by a road and *w*_{i} is its length.

Between each pair of cities no more than one road exists. There are no roads that start and finish in one city. The capital's number is 1.

Output

In the first line print the number of roads in the required set. The second line should contain the numbers of roads included in the sought set. If the sought set does not exist, print -1.

Examples

Input

4 5 2

1 2 1

2 3 1

3 4 1

1 3 3

1 4 2

Output

3

1 5 2

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/19/2017 14:12:34 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|