We know the time it takes for the train to travel between each pair of adjacent stations on its route. The departure time from the initial station is also known. Write a program that calculates the departure time from each station along the route of the electric train (for the last station, this will be the arrival time; we ignore the train's stopping time at the stations).
The first line contains the train's departure time from the initial station. The time is given in the following format: the first two digits represent the hours (from 00 to 23), then a colon, followed by two digits for the minutes (from 00 to 59). There are no spaces in this line.
The second line gives the number of stations (2 \leq N \leq 1000) on the route (including the initial and the final stations). The third line contains N-1 integers: the first number is the travel time (in minutes) from the initial station to the second, the second number is the travel time from the second station to the third, and so on. Each of these numbers is a natural number and does not exceed .
Print the time when the train passes through each station. Give the time in the same format as in the input.
Example 1