You attended the final stage of the Tour De France, and after the event has ended, you want to know the final results. However, all you know is how long it took each biker to reach your position, and how fast they were traveling when they passed you.
Given your constant position during the race, the position of the finish line, and the information described above, you must figure out the final standings of the race. You can assume that after each biker passed you, they maintained a constant speed.
The first line of input contains three space-separated integers $$$n$$$, $$$m$$$, and $$$k$$$, representing the number of bikers in the race, your position, in miles, and the position of the finish line, in miles, respectively. The next $$$n$$$ lines each contain a string representing each biker's name, and a space, followed by two space-separated decimal numbers, representing the time that the biker passed by you, in seconds, and the biker's speed, in miles per hour, respectively.
Output $$$n$$$ integers: each biker's name, sorted by their overall place in the race. The biker that finished first should be first in the list, and the biker that finished last should be last in the list.
5 10 25 CadelEvans 20 30 BradleyWiggins 21 29 ChrisFroome 22 31 VincenzoNibali 25 80 GeraintThomas 5 17 EganBernal 8 21
GeraintThomas CadelEvans BradleyWiggins ChrisFroome VincenzoNibali
This problem was originally made for the contest where all of the problems were based on Kraftwerk songs. It was removed from the contest beforehand for various reasons.
