#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

int h, m, s, t;

int main(){
	while (cin >> h >> m >> s){
		if (h == -1 && m == -1 && s == -1)break;
		int sum = 3600 * h + 60 * m + s,
			t1 = 7200 - sum,
			t2 = 7200 - sum / 3;
		printf("%02d:%02d:%02d\n", t1 / 3600, t1 % 3600 / 60, t1 % 60);
		printf("%02d:%02d:%02d\n", t2 / 3600, t2 % 3600 / 60, t2 % 60);
	}
}