B"There are two rival donut shops. The first shop sells donuts at retail: each donut costs a dollars. The second shop sells donuts only in bulk: box of b donuts costs c dollars. So if you want to buy x donuts from this shop, then you have to buy the smallest number of boxes such that the total number of donuts in them is greater or equal to x . You want to determine two positive integer values: If any of these values doesn't exist then that value should be equal to -1 . If there are multiple possible answers, then print any of them. The printed values should be less or equal to 10^9 . It can be shown that under the given constraints such values always exist if any values exist at all. The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of testcases. Each of the next t lines contains three integers a , b and c ( 1 <= a <= 10^9 , 2 <= b <= 10^9 , 1 <= c <= 10^9 ). For each testcase print two positive integers. For both shops print such x that buying x donuts in this shop is strictly cheaper than buying x donuts in the other shop. x should be greater than 0 and less or equal to 10^9 . If there is no such x , then print -1 . If there are multiple answers, then print any of them. In the first testcase buying any number of donuts will be cheaper in the second shop. For example, for 3 or 5 donuts you'll have to buy a box of 10 donuts for 4 dollars. 3 or 5 donuts in the first shop would cost you 15 or 25 dollars, respectively, however. For 20 donuts you'll have to buy two boxes for 8 dollars total. Note that 3 and 5 are also valid answers for the second shop, along with many other answers. In the second testcase buying any number of donuts will be either cheaper in the first shop or the same price. 8 donuts cost 32 dolla"...