Problem Description
These few days, Rar the Cat has been playing with twines for such a long time that he has completely forgotten to study! Thus, his parents, being very strict cats, has punished Rar the Cat to be locked up in a windowless room for N seconds.
Due to the fact that N can be a very large number, Rar the Cat wants to know what time it would be when he finally gets to leave the room. Given the time Rar the Cat begins his confinement period in 24-hour time, output the time in which Rar will end his confinement period.
Input
The first line of input will contain three integers, the hour, minute and second of the 24-hour time Rar the Cat begins the confinement period.
The second line of input will contain one integer, N.
Output
Your output should contain three integers, the hour, minute and second of the 24-hour time Rar the Cat ends his confinement period.
Your output should be terminated with a newline.
Limits
Subtask 1 (8%): 1 ≤ N ≤ 50
Subtask 2 (15%): 1 ≤ N ≤ 50 000
Subtask 3 (23%): 1 ≤ N ≤ 1 000 000
Subtask 4 (54%): 1 ≤ N ≤ 1 000 000 000 000
Subtask 5 (0%): As per sample testcases
Sample Input 1
0 0 0
6
Sample Output 1
0 0 6
Sample Input 2
23 59 59
1
Sample Output 2
0 0 0