== include(page="template/taskheader" task_id="viteza2") ==

"Speedy" $Mirel$ just bought himself a new IA-mobile(a new generation car) and wants to take it to a ride through $Targu Mures$. The city is formed of $M$ bidirectional streets and $N$ intersections, each street connecting $2$ different intersections. Having lots of free time he wants for each pair of cities $(i, j)$ to find the shortest path to intersection $j$ starting from intersection $i$ and going only through streets in the city. Unfortunately for him(and for you) he insists that on each street through which he passes to reach a higher speed than what he has reached on the previous one.

"Speedy" $Mirel$ just bought himself a new IA-mobile (a new generation car) and wants to take it to a ride through $Targu Mures$. The city is formed of $M$ bidirectional streets and $N$ intersections, each street connecting $2$ different intersections. Having lots of free time he wants for each pair of cities $(i, j)$ to find the shortest path to intersection $j$ starting from intersection $i$ and going only through streets in the city. Unfortunately for him(and for you) he insists that on each street through which he passes to reach a higher speed than what he has reached on the previous one.

On every intersection he has to brake(so his speed drops to 0) and the longer the street is the higher the speed he can reach on it.
Unfortunately $Mirel$ isn't good at other things besides driving so he asks for your help in determining for each pair of intersections $(i, j)$ how fast can he go from intersection $i$ to intersection $j$ reaching on each street passed a higher speed than on the previous one.