#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <map> #include <set> #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <ctime> #include <cstdlib> #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define FFOR(i,a,b) for(int i=(a);i<=(b);i++) #define REP(i,b) FOR(i,0,b) #define RREP(i,b) FFOR(i,1,b) #define PB push_back #define F first #define S second #define BE(c) c.begin(),c.end() using namespace std; typedef long long LL; typedef LL ut; typedef long double ld; typedef pair<ut,ut> pr; typedef vector<pr> Vpr; typedef vector<ut> VI; typedef pair<ut,pr> ppr; typedef priority_queue<pr,Vpr, greater<pr> > PQ; const int SIZE=1e+5 + 1; const ut INF=1<<29; const ld eps=1e-6; const LL mod=1e+6 + 3; int main() { int n, h, m, t; cin >> n >> h >> m >> t; int ph = t / 60, pm = t % 60; REP(i,n-1){ h += ph; m += pm; if(m >= 60){ h++; m -= 60; } h %= 24; } cout << h << endl; cout << m << endl; return 0; }