#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef pair<double,double> P;
typedef complex<double> CP;
typedef long long ll;

int h,m,s;
int tim;

int main(){
	while(cin>>h>>m>>s,!(h==-1&&m==-1&&s==-1)){
		tim=h*3600+m*60+s;
		int rest=7200-tim;
		int tmp = rest;
		rep(i,2){
			rest=tmp;
		h=rest/3600;
		rest%=3600;
		m=rest/60;
		rest%=60;
		s=rest;
		if(h==0) cout<<"00";
		else cout<<0<<h;
		cout<<":";
		if(m==0) cout<<"00";
		else if(m<10) cout<<0<<m;
		else cout<<m;
		cout<<":";
		if(s==0) cout<<"00";
		else if(s<10) cout<<0<<s;
		else cout<<s;
		cout<<endl;
		tmp*=3;
		}
	}
	return 0;
}