import sys, os
import math
from collections import Counter
TC = False
def solve():
h,m = str(input()).split(':')
add_min = int(input())
add_h = add_min//60
add_m = add_min%60
h = int(h) + add_h
m = int(m) + add_m
while m >= 60:
h += 1
m -= 60
while h >= 24:
h -= 24
print('{:02d}:{:02d}'.format(h,m))
if os.path.exists('input.txt'):
debug = True
sys.stdin = open("input.txt","r")
if TC:
for _ in range(int(input())):
solve()
else:
solve()#include<bits/stdc++.h>
using namespace std;
void print_time(int h,int m){
if(h<10) cout<<0;
cout<<h<<":";
if(m<10) cout<<0;
cout<<m;
}
void solve(){
int h,m,a;
char c;
cin>>h>>c>>m>>a;
while(a--){
m++;
if(m==60) h++,m=0;
if(h==24) h=0;
}
print_time(h,m);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int tc=1; //cin>>tc;
while(tc--) solve();
return 0;
}
//ACplease!!!
/* printf(" \n");
printf(" \n");
printf(" * * * * * * * * * * * * \n");
printf(" * * * * * * * * \n");
printf(" * * * * * * * * \n");
printf(" * * * * * \n");
printf(" * * * * * \n");
printf(" * * * * * \n");
printf(" * * * * * \n");
printf(" * * * * * \n");
printf(" * * * * * \n");
printf(" * * * * * * * * * * * * * * * * * * * * * * * * \n");
*/
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |