#include<complex>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<vector>
#include<map>
#include<sstream>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<deque>
#include<queue>
#include<climits>
#include<list>
#include<stack>
#include<ctime>
#define all(n) n.begin(),n.end()
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define insert(a,b,c,d) PP(P(a,b),P(c,d))
#define F first
#define S second
#define Iter(c) __typeof__((c).begin())
#define foreach(i,c) for(Iter(c) i = (c).begin();i != (c).end();++i)
#define pb push_back
#define INF (1<<27)
#define EPS 1e-10
#define equals(a,b) (fabs((a)-(b)) < EPS)

using namespace std;
typedef pair<int,int> P;
typedef pair<P,P> PP;
typedef unsigned long long ull;
typedef long long ll;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};

int Clock(int h,int m,int s)
{
  return h*3600+m*60+s;
}

string itos(int i)
{
  stringstream ss;
  ss << i;
  return ss.str();
}

void print(int Time)
{
  int h,m,s;
  h = Time/3600;
  Time -= Time/3600*3600;
  m = Time/60;
  Time -= Time/60*60;
  s = Time;
  string ele[3];
  ele[0] = itos(h);
  ele[1] = itos(m);
  ele[2] = itos(s);
  cout << string(2-ele[0].length(),'0') << ele[0] << ":" << string(2-ele[1].length(),'0') << ele[1] << ":" << string(2-ele[2].length(),'0') << ele[2] << endl; 

}

int main(){

  int h,m,s;
  while(true)
    {
      cin >> h >> m >> s;
      if(h+m+s == -3)
	break;
      int TimeX = Clock(2,0,0);
      int Time = Clock(h,m,s);
      print(TimeX-Time);
      print(TimeX-Time/3);
    }

  return 0;
}