Problem description: ask for 3 process, in accordance with the shortest time remaining priority scheduling algorithm to find the last execution of the process name, (if two processes at the same time remaining, the preference into the process of the operating system, such as: P4 and P6 at the same time remaining, P6 entered, after, first choose the P6 executed)
Input: program requirements input 3 rows to return character as a delimiter, each line has three data, with a space as a separate, first enter a string (length less than or equal to 10), as the process name, the second for the integer data type, the operation of the said process time,
Output: the output a string, for the final of the execution process,

Input the sample:
P1 1 1
The P2 2 2
3 3 P3
The output sample:
P3