#include <cstdio>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <iostream>

 #include <algorithm>

 #include <map>

 #include <set>

 #include <queue>

 #include <vector>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int, int> PII;

 typedef vector<int> VI;

 #define fi first

 #define se second

 #define MP make_pair

 int read()

 {

     int v = , f = ;

     char c = getchar();

     while (c <  ||  < c) {if (c == '-') f = -; c = getchar();}

     while ( <= c && c <= ) v = (v << ) + v + v + c - , c = getchar();

     return v * f;

 }

 char ch[];

 int main()

 {

     int cas = read();

     while (cas--)

     {

         int x = read(), y = read();

         scanf("%s", ch);

         int flag=;

         int p = , q = ;

         if (ch[]=='-')flag=-;

         p = p *  + ch[] - '';

         if (ch[])

         {

             if (ch[] != '.')

             {

                 p = p *  + ch[] - '';

                 if (ch[] == '.')

                     q = ch[] - '';

             } else

             {

                 q = ch[] -'';

             }

         }

         p*=flag;q*=flag;

         p -= ;

         x += p;

         y += q * ;

         x += y / ;

         y %= ;

         if (y<){x--;y+=;}

         x = (x %  + ) % ;

         printf("%02d:%02d\n", x, y);

         for (int i = ; ch[i]; i++)

             ch[i] = ;

     }

 }