SPOJ in Gyumri

   Mamane regularly organizes horse race. But he needs your help to test the effectiveness of his chronometer.

   Given the length L of the race circuit into meter and average speed of the horse V into meters per second (m/s), your task is to write a program that will determine the time it takes the horse in hours, minutes and seconds, in format HH:MM:SS where HH is a two-digit number representing the number of hours ; MM (MM < 60) , a two-digit number representing the number of minutes, and SS (SS < 60), a two-digit number representing the number of seconds. SS and MM must each have the greatest possible value. In this problem, L and V are integers and HH will be strictly lower than 24.

Input.

   The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set consists of one line containing the length L, the space and the average speed V of the horse.

Output.

   For each data set, generate one line of output containing the time in format HH:MM:SS.  

Sample test.