#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>
using namespace std;
#define INF	100000000
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define lb lower_bound
#define ub upper_bound
#define SS stringstream
#define rep(i,n) for(int i = 0; i < n; i++)
#define sz(x) ((int)(x).size())
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define clr(a,b) memset((a),(b),sizeof(a))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<P> Vp;
typedef priority_queue<P, vector<P>, greater<P> > PQ;

int h,m,s;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin >> h >> m >> s){
		int t;
		int a[3];
		if(h == -1 && m == -1 && s == -1) break;
		t = 120*60-h*3600-m*60-s;
		rep(i,2){
			a[0] = t/3600; a[1] = (t%3600)/60; a[2] = t%60;
			rep(j,3){
				if(j == 0){
					if(a[j] <= 9) cout << "0";
					cout << a[j];
				} else{
					cout << ":";
					if(a[j] <= 9) cout << "0";
					cout << a[j];
				}
			}
			cout << endl;
			t *= 3;
		}
	}
}