Time Limit: 6000 ms

Memory Limit: 65535 ms


As the chairman of Technology Association, Xiaoyoulei has Obtained great achievements on the ability of “Huyou”and ,done great contributions on the construction of our school.

Our school is so big that every small costs turns to be huge after being multiplied by the number of people living here and the area of school. As the inflation nowadays, it becomes more and more important to decline the costs.

To reduce the Electric costs of NJUST, Xiaoyouleihas decided to optimize the road lighting. Till now every road was illuminated all night long, which costs 1 yuan per meter and day. To save money, he decided to no longer illuminate every road, but to switch off the road lighting of some streets. To make sure that the inhabitants of NJUST still feel safe, he want to optimize the lighting in such a way, that after darkening some streets at night, there will still be at least one illuminated path from every crossing in NJUST to every other crossing.

What is the maximum daily amount of money Xiaoyoulei can save, without making their inhabitants feel unsafe?


The input file contains several test cases. Each test case starts with two numbers m and n, the number of crossings in Byteland and the number of roads in Byteland, respectively. Input is terminated by m=n=0. Otherwise, 1 ≤ m ≤ 200000 and m-1 ≤ n ≤ 200000. Then follow n integer triples x, y, z specifying that there will be a bidirectional road between x and y with length z meters (0 ≤ x, y < m and x ≠ y). The graph specified by each test case is connected. The total length of all roads in each test case is less than 231.


For each test case print one line containing the maximum daily amount the government can save.

Sample Input

7 11
0 1 7
0 3 5
1 2 8
1 3 9
1 4 7
2 4 5
3 4 15
3 5 6
4 5 8
4 6 9
5 6 11
0 0

Sample Output