#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if (p != -1) { x %= p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; void solve() { int a,b; string s; cin>>a>>b>>s; if(s.size()==5){ int num=s.back()-'0'; if(s[s.size()-2]=='+'){ num-=9; a+=num; } else { num+=9; a-=num; } }else if(s.size()==6){ int num=10+(s.back()-'0'); if(s[s.size()-3]=='+'){ num-=9; a+=num; } else { num+=9; a-=num; } }else if(s.size()==7){ int min=6*(s.back()-'0'); int num=s[s.size()-3]-'0'; if(s[s.size()-4]=='+'){ num-=9; a+=num; b+=min; } else { num+=9; a-=num; b-=min; } }else{ int min=6*(s.back()-'0'); int num=10+(s[s.size()-3]-'0'); if(s[s.size()-5]=='+'){ num-=9; a+=num; b+=min; } else { num+=9; a-=num; b-=min; } } if(b<0){ a--; b=(b+60)%60; }else if(b>=60){ a++; b%=60; } a=(a+24)%24; if(a<10){ cout<<"0"<