Alice and Gromozeka went for a walk around the city. Entering the first cafe, Alice looked at her watch and remembered the time of entry. Further, she memorized only the number of minutes that she and Gromozeka spent between two cafes visited (from entering one cafe to entering another). At the end of the walk, Alice decided to restore the chronology - the time of entering the next cafe.
Write a program that will determine at what time Alice and Gromozeka went to the next cafe.
Input
The first line specifies the moment of time at which Gromozeka and Alice entered the first cafe. Time format: hours (a number from
00 to
23), followed by a colon, then minutes (a number from
00 to
59). The time string is written without spaces.
The second line contains a natural number N (2 <= N <= 1000) - the number of visited cafes (including the cafe from which they left at the initial moment of time and the last cafe). The third line contains N-1 number: the first one shows the time in minutes from the entrance to the first cafe to the entrance to the second one, the second - the time from the entrance to the second cafe to the entrance to the third one, and so on. Each of these numbers is natural and does not exceed 1000.
Imprint
Print for each cafe the entry time of Alice and Gromozeka. The time format must be the same as in the input data.
Examples
| # |
Input |
Output |
| 1 |
07:00
4
10 5 3
| 07:00
07:10
07:15
07:18 |