#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
#include <sstream>
#include <queue>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
#define print(s) cout << (s) << endl

void printTime(int sec) {
    int h = sec / 3600;
    sec %= 3600;
    int m = sec / 60;
    sec %= 60;
    printf("%02d:%02d:%02d\n", h, m, sec);
}

void solve74(int h, int m, int s) {
    int sec = 3600 * h + 60 * m + s;
    int left = 7200 - sec;
    printTime(left);
    printTime(left * 3);
}

int main() {
    int h, m, s;
    while (cin>>h>>m>>s, h+m+s+3) {
        solve74(h,m,s);
    }
    return 0;
}