/* 1.类似大数问题,对进位的处理;
*/
#include<iostream>
using namespace std;int main()
{
int n;
int h1,h2,m1,m2,s1,s2;
cin>>n;
while(n--)
{
int carry1=0,carry2=0;
cin>>h1>>m1>>s1>>h2>>m2>>s2;
if(s1+s2>=60) carry1=1;
s1=(s1+s2)%60;
if(m1+m2+carry1>=60) carry2=1;
m1=(m1+m2+carry1)%60;
h1=h1+h2+carry2;
cout<<h1<<' '<<m1<<' '<<s1<<endl;
}
return 0;
}