Given two positive integers num1 and num2, the task is to find the product of the two numbers on a 12 hour clock rather than a number line.
First line of the input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of a single line containing two integers separated by a space .
Corresponding to each test case, print the difference in a new line.
1 <=T <= 100
1 <= num1 <= 1000
1 <= num2 <= 1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.