rblock

Problem Description

Every morning, FJ wakes up and walks across the farm from his house to the barn. The farm is a collection of N fields connected by M bidirectional pathways, each with an associated length. FJ's house is in field 1, and the barn is in field N. No pair of fields is joined by multiple redundant pathways, and it is possible to travel between any pair of fields in the farm by walking along an appropriate sequence of pathways. When traveling from one field to another, FJ always selects a route consisting of a sequence of pathways having minimum total length.

Farmer John's cows, up to no good as always, have decided to interfere with FJ's morning routine. They plan to build a pile of hay bales on exactly one of the M pathways on the farm, doubling its length. The cows wish to select a pathway to block so that they maximize the increase in FJ's distance from the house to the barn. Please help the cows determine by how much they can lengthen FJ's route.

Input

The first line of input consists of 2 integers: N and M.

Subsequently, M lines follow with 3 integers each: A_i, B_i and C_i, where A_i and B_i are indices in the range 1..N indicating the fields joined by the pathway, and L_i is the length of the pathway.

Output

Output a single integer, the maximum possible increase in the total length of FJ's shortest route made possible by doubling the length of a single pathway.

Limits

1 ≤ N ≤ 100

1 ≤ M ≤ 10,000

1 ≤ A_i, B_i ≤ N

1 ≤ L_i ≤ 1,000,000

Sample Input 1

5 7
2 1 5
1 3 1
3 2 8
3 5 7
3 4 3
2 4 7
4 5 2

Sample Output 1

2

Explanation for Sample Output 1

If the cows double the length of the pathway from field 3 to field 4 (increasing its length from 3 to 6), then FJ's shortest route is now 1-> 3-> 5, of total length 1 + 7 = 8, larger by two than the previous shortest route length.