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

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,b,n) for(int i=b;i<n;i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
	int hour,mi,sec;
	while(cin>>hour>>mi>>sec){
		if(hour==-1&&mi==-1&&sec==-1){
			break;
		}
		int sum =hour*60*60+mi*60+sec;
		int sum1 =(hour*60*60+mi*60+sec)/3;
		sum =2*60*60-sum;
		sum1=2*60*60-sum1;
		int a,b,c;
		if(sum/(60*60)){
			a = sum/(60*60);
			sum -=a*60*60;
		}
		if(sum/60){
			b = sum/(60);
			sum -=b*60;
		}
		c = sum;
		printf("%02d:%02d:%02d\n",a,b,c);
		if(sum1/(60*60)){
			a = sum1/(60*60);
			sum1 -=a*60*60;
		}
		if(sum1/60){
			b = sum1/(60);
			sum1 -=b*60;
		}
		c = sum1;
		printf("%02d:%02d:%02d\n",a,b,c);
	}
	return 0;
}