算法题：2013腾讯编程马拉松初赛第二场（3月22日）小Q系列故事——为什么时光不能倒流

输入首先包含一个整数N，表示有N组测试用例。

接下来的N行表示N个测试用例，每行包括2个时间HH:MM:SS hh:mm:ss

HH:MM:SS表示当前的时间，hh:mm:ss表示希望倒退回去的时间。

[Technical Specification]

00<=HH<=11

00<=hh<=99

00<=MM, SS, mm, ss<=59

Sample Input

2

11:28:32 02:14:21

05:00:00 96:00:01





Sample Output

09:14:11

04:59:59-Algorithms title: 2013 Tencent programming marathon preliminary second (March 22) Q series of small stories- Why can not rewind enter first contains an integer N, N set of test cases indicated. The next N lines represent N test cases, each row including two time HH: MM: SS hh: mm: ss HH: MM: SS indicates the current time, hh: mm: ss expressed the hope that retrogression back time. [Technical Specification] 00 < = HH < = 11 00 < = hh < = 99 00 < = MM, SS, mm, ss < = 59 Sample Input 2 11:28:32 02:14:21 05:00:00 96 : 00:01 Sample Output 09:14:11 04:59:59