B'You are a mayor of Berlyatov. There are n districts and m two-way roads between them. The i -th road connects districts x_i and y_i . The cost of travelling along this road is w_i . There is some path between each pair of districts, so the city is connected. There are k delivery routes in Berlyatov. The i -th route is going from the district a_i to the district b_i . There is one courier on each route and the courier will always choose the cheapest (minimum by total cost) path from the district a_i to the district b_i to deliver products. The route can go from the district to itself, some couriers routes can coincide (and you have to count them independently). You can make at most one road to have cost zero (i.e. you choose at most one road and change its cost with 0 ). Let d(x, y) be the cheapest cost of travel between districts x and y . Your task is to find the minimum total courier routes cost you can achieve, if you optimally select the some road and change its cost with 0 . In other words, you have to find the minimum possible value of sum limits_{i = 1}^{k} d(a_i, b_i) after applying the operation described above optimally. The first line of the input contains three integers n , m and k ( 2 <= n <= 1000 ; n - 1 <= m <= min(1000, frac{n(n-1)}{2}) ; 1 <= k <= 1000 ) -- the number of districts, the number of roads and the number of courier routes. The next m lines describe roads. The i -th road is given as three integers x_i , y_i and w_i ( 1 <= x_i, y_i <= n ; x_i ne y_i ; 1 <= w_i <= 1000 ), where x_i and y_i are districts the i -th road connects and w_i is its cost. It is guaranteed that there is some path between each pair of districts, so the city is connected. It is also guaranteed that there is at most one road between each pair of distric'...